Semidefinite Programs for Exact Recovery of a Hidden Community (and Many Communities)
|
|
- Beverley Johnston
- 5 years ago
- Views:
Transcription
1 Semidefinite Programs for Exact Recovery of a Hidden Community (and Many Communities) Bruce Hajek 1 Yihong Wu 1 Jiaming Xu 2 1 University of Illinois at Urbana-Champaign 2 Simons Insitute, UC Berkeley June 23, 2016
2 Hidden community model [Deshpande-Montanari 13] P Q Data: n n symmetric matrix A with empty diagonal Community C [n] of size K uniform at random, such that { P both i and j C A ij Q otherwise Q Q (K, P, Q) varies with n Goal: exact recovery of C from A P{Ĉ = C } n 1 Fruitful venue for stuying computational aspects of statistical problems Bruce Hajek, Yihong Wu and Jiaming Xu SDP for Community Recovery 2
3 Examples Planted dense subgraph P = Bern(p), Q = Bern(q), p > q A = adjancency matrix of G(n, q) planted with G(K, p) [Alon et al 98, McSherry 01, Arias-Castro-Verzelen 14, Chen-Xu 14, Montanari 15,...] Bruce Hajek, Yihong Wu and Jiaming Xu SDP for Community Recovery 3
4 Examples Planted dense subgraph P = Bern(p), Q = Bern(q), p > q A = adjancency matrix of G(n, q) planted with G(K, p) [Alon et al 98, McSherry 01, Arias-Castro-Verzelen 14, Chen-Xu 14, Montanari 15,...] Submatrix localization P = N (0, µ), Q = N (0, 1), µ > 0 A = µ 0 + noise [Shabalin et al 09, Butucea-Ingster 11, Kolar et al 11, Ma-W 13, Cai et al 15,...] Bruce Hajek, Yihong Wu and Jiaming Xu SDP for Community Recovery 3
5 Running example: Plated Dense Subgraph
6 Planted dense subgraph graph view Bruce Hajek, Yihong Wu and Jiaming Xu SDP for Community Recovery 5
7 Planted dense subgraph graph view 1 A community of K vertices are chosen randomly Bruce Hajek, Yihong Wu and Jiaming Xu SDP for Community Recovery 5
8 Planted dense subgraph graph view 1 A community of K vertices are chosen randomly 2 For every pair of nodes in the community, add an edge w.p. p Bruce Hajek, Yihong Wu and Jiaming Xu SDP for Community Recovery 5
9 Planted dense subgraph graph view 1 A community of K vertices are chosen randomly 2 For every pair of nodes in the community, add an edge w.p. p 3 For other pairs of nodes, add an edge w.p. q Bruce Hajek, Yihong Wu and Jiaming Xu SDP for Community Recovery 5
10 Planted dense subgraph graph view 1 A community of K vertices are chosen randomly 2 For every pair of nodes in the community, add an edge w.p. p 3 For other pairs of nodes, add an edge w.p. q Bruce Hajek, Yihong Wu and Jiaming Xu SDP for Community Recovery 5
11 Planted dense subgraph adjacency matrix view n = 200, K = 50, p = 0.3, q = 0.1 Bruce Hajek, Yihong Wu and Jiaming Xu SDP for Community Recovery 6
12 Planted dense subgraph adjacency matrix view n = 200, K = 50, p = 0.3, q = 0.1 Bruce Hajek, Yihong Wu and Jiaming Xu SDP for Community Recovery 6
13 Planted dense subgraph adjacency matrix view n = 200, K = 50, p = 0.3, q = 0.1 Bruce Hajek, Yihong Wu and Jiaming Xu SDP for Community Recovery 6
14 Computational gap in planted Clique p = 1 q = Ω(1) K = Ω(log n): exact recovery is possible via maximum likelihood K = Ω( n): exact recovery is attainable in poly-time [Alon et al. 98] K = o( n): exact recovery is believed to be hard [Deshpande-Montanari 15] [Meka-Potechin-Wigderson 15],... Bruce Hajek, Yihong Wu and Jiaming Xu SDP for Community Recovery 7
15 Computational gap in planted Clique p = 1 q = Ω(1) K = Ω(log n): exact recovery is possible via maximum likelihood K = Ω( n): exact recovery is attainable in poly-time [Alon et al. 98] K = o( n): exact recovery is believed to be hard [Deshpande-Montanari 15] [Meka-Potechin-Wigderson 15],... What about dense subgraphs clique? Bruce Hajek, Yihong Wu and Jiaming Xu SDP for Community Recovery 7
16 Linear community size K = ρ n p = a log n n and q = b log n n Theorem (Hajek-W-Xu Trans. IT 16) If ρ > ρ, exact recovery is possible in polynomial-time. If ρ < ρ, exact recovery is impossible. Remarks ρ = 1/(a τ log ea τ ) with τ = Convex (SDP) relaxation works a b log a log b Bruce Hajek, Yihong Wu and Jiaming Xu SDP for Community Recovery 8
17 Sublinear community size [Hajek-W-Xu, COLT 15] β 1 K = Θ(n β ) 1/2 O easy PC hard? impossible 2/3 p = cq = Θ(n α ) 1 α K = Ω(n): SDP works K = n 1 ɛ : no known poly-time algorithm Where is the SDP barrier? Bruce Hajek, Yihong Wu and Jiaming Xu SDP for Community Recovery 9
18 Sublinear community size [Hajek-W-Xu, COLT 15] β 1 K = Θ(n β ) 1/2 O easy PC hard? impossible 2/3 p = cq = Θ(n α ) 1 α K = Ω(n): SDP works K = n 1 ɛ : no known poly-time algorithm Where is the SDP barrier? K = Θ( n log n ) Bruce Hajek, Yihong Wu and Jiaming Xu SDP for Community Recovery 9
19 SDP Relaxation vs. Information-Theoretic Limits Main results: For both planted dense subgraph (Bernoulli) and submatrix localization (Gaussian) K = ω( n log n ): SDP attains the info-theoretic limit with sharp constants K = Θ( n log n ): SDP is order-wise optimal, but strictly suboptimal by a constant factor K = o( n log n ) and K : SDP is order-wise suboptimal Bruce Hajek, Yihong Wu and Jiaming Xu SDP for Community Recovery 10
20 SDP Relaxation vs. Information-Theoretic Limits Log-likelihood ratio matrix L Let ξ = indicator of C. L ij = log dp dq (A ij), i j, L ii = 0 Maximum likelihood estimator = find densest K-subgraph ˆξ MLE = arg max L ij ξ i ξ j ξ i,j s.t. ξ {0, 1} n ξ, 1 = K. Bruce Hajek, Yihong Wu and Jiaming Xu SDP for Community Recovery 11
21 Lift: Z = ξξ Ẑ MLE = arg max L, Z Z s.t. rank(z) = 1 Z ii 1 Z ij 0, I, Z = K J, Z = K 2 i [n] i, j [n] Bruce Hajek, Yihong Wu and Jiaming Xu SDP for Community Recovery 12
22 Semidefinite programming Natural SDP relaxation: Ẑ SDP = arg max L, Z Z s.t. Z 0 Z ii 1 Z 0 I, Z = K J, Z = K 2 i [n] Bruce Hajek, Yihong Wu and Jiaming Xu SDP for Community Recovery 13
23 Semidefinite programming Natural SDP relaxation: Ẑ SDP = arg max L, Z Z s.t. Z 0 Z ii 1 Z 0 I, Z = K J, Z = K 2 i [n] Goal: P Ẑ SDP = ẐMLE = Bruce Hajek, Yihong Wu and Jiaming Xu SDP for Community Recovery 13
24 Analysis of SDP Define e(i, C ) = j C L ij, i [n],, β = D(Q P). Bruce Hajek, Yihong Wu and Jiaming Xu SDP for Community Recovery 14
25 Analysis of SDP Theorem Sufficient condition: Ẑ SDP = Z, if { } min e(i, C ) max max e(j, C ), Kβ > L E [L] β i C j / C Bruce Hajek, Yihong Wu and Jiaming Xu SDP for Community Recovery 15
26 Analysis of SDP Theorem Sufficient condition: Ẑ SDP = Z, if { } min e(i, C ) max max e(j, C ), Kβ > L E [L] β i C j / C Necessary condition: If Z ẐSDP, then { min e(i, C ) max e(j, C ) sup V (a) a } i C j / C 1 a K K max e(j, C ), j / C where V (a) = max{ LC C, Z : Z 0, Z 0, Tr(Z) = 1, J, Z = a} is the value of an (simpler) auxilliary SDP Bruce Hajek, Yihong Wu and Jiaming Xu SDP for Community Recovery 15
27 Remarks To apply this result, min, max, L E [L], etc concentrate Sufficient condition proof: construction of dual witnesses (standard) Bruce Hajek, Yihong Wu and Jiaming Xu SDP for Community Recovery 16
28 Proof of necessary condition Primal proof: random perturbation of the ground truth to establish integrality gap Z = 1 Z = 0 Z = 0 Bruce Hajek, Yihong Wu and Jiaming Xu SDP for Community Recovery 17
29 Proof of necessary condition Primal proof: random perturbation of the ground truth to establish integrality gap Z = Z = 0 Z = 0 + Bruce Hajek, Yihong Wu and Jiaming Xu SDP for Community Recovery 17
30 Proof of necessary condition Primal proof: random perturbation of the ground truth to establish integrality gap Z = Z = 0 Z = 0 + Dual proof: non-existence of dual witness Bruce Hajek, Yihong Wu and Jiaming Xu SDP for Community Recovery 17
31 Multiple communities
32 k communities: MLE SDP relaxation SBM with k communities and parameter (p, q) max k A, θ l θl l=1 s.t. θ l {0, 1} n θ l, 1 = n/k θ l, θ l = 0, l l Bruce Hajek, Yihong Wu and Jiaming Xu SDP for Community Recovery 19
33 k communities: MLE SDP relaxation SBM with k communities and parameter (p, q) max k A, θ l θl max A, Z l=1 s.t. θ l {0, 1} n lift: Z= k l=1 θ lθ l ========== s.t. rank(z) = k θ l, 1 = n/k Z ii = 1 i [n] θ l, θ l = 0, l l Z ij 0, Z ij = n/k j Bruce Hajek, Yihong Wu and Jiaming Xu SDP for Community Recovery 19
34 k communities: MLE SDP relaxation SBM with k communities and parameter (p, q) max k A, θ l θl max A, Z l=1 s.t. θ l {0, 1} n lift: Z= k l=1 θ lθ l ========== s.t. Z 0 θ l, 1 = n/k Z ii = 1 i [n] θ l, θ l = 0, l l Z ij 0, Z ij = n/k j Bruce Hajek, Yihong Wu and Jiaming Xu SDP for Community Recovery 19
35 k communities: MLE SDP relaxation SBM with k communities and parameter (p, q) max k A, θ l θl max A, Z l=1 s.t. θ l {0, 1} n lift: Z= k l=1 θ lθ l ========== s.t. Z 0 θ l, 1 = n/k Z ii = 1 i [n] θ l, θ l = 0, l l Z ij 0, Z ij = n/k Goal: P Ẑ SDP = j Bruce Hajek, Yihong Wu and Jiaming Xu SDP for Community Recovery 19
36 k equal-sized communities: optimal recovery via SDP Theorem (Hajek-W-Xu 15) For a fixed k communities with p = a log n/n and q = b log n/n. If a b > k, exact recovery is attained via SDP in poly-time. If a b < k, exact recovery is impossible. Bruce Hajek, Yihong Wu and Jiaming Xu SDP for Community Recovery 20
37 k equal-sized communities: optimal recovery via SDP Theorem (Hajek-W-Xu 15) For a fixed k communities with p = a log n/n and q = b log n/n. If a b > k, exact recovery is attained via SDP in poly-time. If a b < k, exact recovery is impossible. Remarks Extended to k = o(log n) in [Agarwal-Bandeira-Koiliaris-Kolla 15] Bruce Hajek, Yihong Wu and Jiaming Xu SDP for Community Recovery 20
38 k equal-sized communities: optimal recovery via SDP Theorem (Hajek-W-Xu 15) For a fixed k communities with p = a log n/n and q = b log n/n. If a b > k, exact recovery is attained via SDP in poly-time. If a b < k, exact recovery is impossible. Remarks Extended to k = o(log n) in [Agarwal-Bandeira-Koiliaris-Kolla 15] Extended to the case with multiple unequal-sized clusters [Perry-Wein 15] Bruce Hajek, Yihong Wu and Jiaming Xu SDP for Community Recovery 20
39 When does SDP cease to be optimal? Theorem (Hajek-W.-Xu 16) k log n: SDP achieves the optimal exact recovery threshold. k c log n: SDP is suboptimal by a constant factor. k log n: SDP is order-suboptimal. Remarks A hard but informationally possible regime is conjectured to exist for exact recovery when k log n [Chen-Xu 14] Bruce Hajek, Yihong Wu and Jiaming Xu SDP for Community Recovery 21
40 Some remaining problems Can the computational gap for exact recovery be bridged by any polynomial time algorithm? (SoS hardness result or reduction to PC would offer further evidence for no answer.) Approximate recovery? (Current proof only rules out exact recovery.) Bruce Hajek, Yihong Wu and Jiaming Xu SDP for Community Recovery 22
41 Some remaining problems Can the computational gap for exact recovery be bridged by any polynomial time algorithm? (SoS hardness result or reduction to PC would offer further evidence for no answer.) Approximate recovery? (Current proof only rules out exact recovery.) Thank you! Bruce Hajek, Yihong Wu and Jiaming Xu SDP for Community Recovery 22
42 Necessary condition for optimality of SDP EXTRA SLIDES NOT INCLUDED IN ORIGINAL Let M = L (C ) c (C ) c denote the submatrix of L outside the community. For a R, consider the (random) value of the following SDP: V (a) max M, Z (1) Z s.t. Z 0 Z 0 Tr(Z) = 1 J, Z = a. Bruce Hajek, Yihong Wu and Jiaming Xu SDP for Community Recovery 23
43 Necessary condition for optimality of SDP Theorem (Necessary condition for SDP) If Z ẐSDP, then { min e(i, C ) max e(j, C ) sup V (a) a } i C j / C 1 a K K max e(j, C ). (2) j / C Weaker necessary condition (set a = K):. min e(i, C ) V (K) i C Bruce Hajek, Yihong Wu and Jiaming Xu SDP for Community Recovery 24
44 SDP vs. MLE, message passing, and linear MP 0.06 ρ 0.04 SDP necessary MLE MP linear MP µ 0 Phase diagram for the Gaussian model with K = ρn/ log n and µ = µ 0 log n/ n. Bruce Hajek, Yihong Wu and Jiaming Xu SDP for Community Recovery 25
Phase Transitions in Semidefinite Relaxations
Phase Transitions in Semidefinite Relaxations Andrea Montanari [with Adel Javanmard, Federico Ricci-Tersenghi, Subhabrata Sen] Stanford University April 5, 2016 Andrea Montanari (Stanford) SDP Phase Transitions
More informationHow Hard Is Inference for Structured Prediction?
How Hard Is Inference for Structured Prediction? Tim Roughgarden (Stanford University) joint work with Amir Globerson (Tel Aviv), David Sontag (NYU), and Cafer Yildirum (NYU) 1 Structured Prediction structured
More informationOn Covering a Graph Optimally with Induced Subgraphs
On Covering a Graph Optimally with Induced Subgraphs Shripad Thite April 1, 006 Abstract We consider the problem of covering a graph with a given number of induced subgraphs so that the maximum number
More informationExact Recovery in Stochastic Block Models
Eact Recovery in Stochastic Block Models Ben Eysenbach May 11, 2016 1 Introduction Graphs are a natural way of capturing interactions between objects, such as phone calls between friends, binding between
More informationWhat Does Robustness Say About Algorithms?
What Does Robustness Say About Algorithms? Ankur Moitra (MIT) ICML 2017 Tutorial, August 6 th Let me tell you a story about the tension between sharp thresholds and robustness THE STOCHASTIC BLOCK MODEL
More informationMapReduce Algorithms. Barna Saha. March 28, 2016
MapReduce Algorithms Barna Saha March 28, 2016 Complexity Model for MapReduce Minimum Spanning Tree in MapReduce Computing Dense Subgraph in MapReduce Complexity Model for MapReduce:MRC i Input: finite
More informationThe Ordered Covering Problem
The Ordered Covering Problem Uriel Feige Yael Hitron November 8, 2016 Abstract We introduce the Ordered Covering (OC) problem. The input is a finite set of n elements X, a color function c : X {0, 1} and
More informationLecture and notes by: Nate Chenette, Brent Myers, Hari Prasad November 8, Property Testing
Property Testing 1 Introduction Broadly, property testing is the study of the following class of problems: Given the ability to perform (local) queries concerning a particular object (e.g., a function,
More informationOn the Approximability of Modularity Clustering
On the Approximability of Modularity Clustering Newman s Community Finding Approach for Social Nets Bhaskar DasGupta Department of Computer Science University of Illinois at Chicago Chicago, IL 60607,
More informationEXPLOITING SPARSITY IN SDP RELAXATION FOR SENSOR NETWORK LOCALIZATION
EXPLOITING SPARSITY IN SDP RELAXATION FOR SENSOR NETWORK LOCALIZATION SUNYOUNG KIM, MASAKAZU KOJIMA, AND HAYATO WAKI Abstract. A sensor network localization problem can be formulated as a quadratic optimization
More informationSpectral Clustering and Community Detection in Labeled Graphs
Spectral Clustering and Community Detection in Labeled Graphs Brandon Fain, Stavros Sintos, Nisarg Raval Machine Learning (CompSci 571D / STA 561D) December 7, 2015 {btfain, nisarg, ssintos} at cs.duke.edu
More informationConvexity Theory and Gradient Methods
Convexity Theory and Gradient Methods Angelia Nedić angelia@illinois.edu ISE Department and Coordinated Science Laboratory University of Illinois at Urbana-Champaign Outline Convex Functions Optimality
More informationLecture 9. Semidefinite programming is linear programming where variables are entries in a positive semidefinite matrix.
CSE525: Randomized Algorithms and Probabilistic Analysis Lecture 9 Lecturer: Anna Karlin Scribe: Sonya Alexandrova and Keith Jia 1 Introduction to semidefinite programming Semidefinite programming is linear
More informationNP-Hardness. We start by defining types of problem, and then move on to defining the polynomial-time reductions.
CS 787: Advanced Algorithms NP-Hardness Instructor: Dieter van Melkebeek We review the concept of polynomial-time reductions, define various classes of problems including NP-complete, and show that 3-SAT
More informationExploiting Sparsity in SDP Relaxation for Sensor Network Localization. Sunyoung Kim, Masakazu Kojima, and Hayato Waki January 2008
Exploiting Sparsity in SDP Relaxation for Sensor Network Localization Sunyoung Kim, Masakazu Kojima, and Hayato Waki January 28 Abstract. A sensor network localization problem can be formulated as a quadratic
More informationComputer Science Approach to problem solving
Computer Science Approach to problem solving If my boss / supervisor / teacher formulates a problem to be solved urgently, can I write a program to efficiently solve this problem??? Polynomial-Time Brute
More informationDivide and Conquer Kernel Ridge Regression
Divide and Conquer Kernel Ridge Regression Yuchen Zhang John Duchi Martin Wainwright University of California, Berkeley COLT 2013 Yuchen Zhang (UC Berkeley) Divide and Conquer KRR COLT 2013 1 / 15 Problem
More informationLearning Probabilistic models for Graph Partitioning with Noise
Learning Probabilistic models for Graph Partitioning with Noise Aravindan Vijayaraghavan Northwestern University Based on joint works with Konstantin Makarychev Microsoft Research Yury Makarychev Toyota
More informationLocal Constraints in Combinatorial Optimization
Local Constraints in Combinatorial Optimization Madhur Tulsiani Institute for Advanced Study Local Constraints in Approximation Algorithms Linear Programming (LP) or Semidefinite Programming (SDP) based
More informationComparing the strength of query types in property testing: The case of testing k-colorability
Comparing the strength of query types in property testing: The case of testing k-colorability Ido Ben-Eliezer Tali Kaufman Michael Krivelevich Dana Ron Abstract We study the power of four query models
More informationTowards Efficient Higher-Order Semidefinite Relaxations for Max-Cut
Towards Efficient Higher-Order Semidefinite Relaxations for Max-Cut Miguel F. Anjos Professor and Canada Research Chair Director, Trottier Energy Institute Joint work with E. Adams (Poly Mtl), F. Rendl,
More informationA primal-dual framework for mixtures of regularizers
A primal-dual framework for mixtures of regularizers Baran Gözcü baran.goezcue@epfl.ch Laboratory for Information and Inference Systems (LIONS) École Polytechnique Fédérale de Lausanne (EPFL) Switzerland
More informationThe limits of adaptive sensing
The limits of adaptive sensing Mark A. Davenport Stanford University Department of Statistics Sparse Estimation -sparse How well can we estimate? Background: Dantzig Selector Choose a random matrix fill
More informationRevisiting Frank-Wolfe: Projection-Free Sparse Convex Optimization. Author: Martin Jaggi Presenter: Zhongxing Peng
Revisiting Frank-Wolfe: Projection-Free Sparse Convex Optimization Author: Martin Jaggi Presenter: Zhongxing Peng Outline 1. Theoretical Results 2. Applications Outline 1. Theoretical Results 2. Applications
More informationComparing the strength of query types in property testing: The case of testing k-colorability
Comparing the strength of query types in property testing: The case of testing k-colorability Ido Ben-Eliezer Tali Kaufman Michael Krivelevich Dana Ron October 1, 2007 Abstract We study the power of four
More informationPolynomial Flow-Cut Gaps and Hardness of Directed Cut Problems
Polynomial Flow-Cut Gaps and Hardness of Directed Cut Problems Julia Chuzhoy Sanjeev Khanna July 17, 2007 Abstract We study the multicut and the sparsest cut problems in directed graphs. In the multicut
More informationHierarchical Clustering: Objectives & Algorithms. École normale supérieure & CNRS
Hierarchical Clustering: Objectives & Algorithms Vincent Cohen-Addad Paris Sorbonne & CNRS Frederik Mallmann-Trenn MIT Varun Kanade University of Oxford Claire Mathieu École normale supérieure & CNRS Clustering
More informationCS Introduction to Data Mining Instructor: Abdullah Mueen
CS 591.03 Introduction to Data Mining Instructor: Abdullah Mueen LECTURE 8: ADVANCED CLUSTERING (FUZZY AND CO -CLUSTERING) Review: Basic Cluster Analysis Methods (Chap. 10) Cluster Analysis: Basic Concepts
More informationStreaming verification of graph problems
Streaming verification of graph problems Suresh Venkatasubramanian The University of Utah Joint work with Amirali Abdullah, Samira Daruki and Chitradeep Dutta Roy Outsourcing Computations We no longer
More informationSolutions. (a) Claim: A d-ary tree of height h has at most 1 + d +...
Design and Analysis of Algorithms nd August, 016 Problem Sheet 1 Solutions Sushant Agarwal Solutions 1. A d-ary tree is a rooted tree in which each node has at most d children. Show that any d-ary tree
More informationWESTFÄLISCHE WILHELMS-UNIVERSITÄT MÜNSTER
MÜNSTER Adaptive Discretization of Liftings for Curvature Regularization SIAM Conference on Imaging Science 2016, Albuquerque, NM Ulrich Hartleif, Prof. Dr. Benedikt Wirth May 23, 2016 Outline MÜNSTER
More informationAn accelerated proximal gradient algorithm for nuclear norm regularized least squares problems
An accelerated proximal gradient algorithm for nuclear norm regularized least squares problems Kim-Chuan Toh Sangwoon Yun Abstract The affine rank minimization problem, which consists of finding a matrix
More informationSome graph theory applications. communications networks
Some graph theory applications to communications networks Keith Briggs Keith.Briggs@bt.com http://keithbriggs.info Computational Systems Biology Group, Sheffield - 2006 Nov 02 1100 graph problems Sheffield
More informationExact Algorithms Lecture 7: FPT Hardness and the ETH
Exact Algorithms Lecture 7: FPT Hardness and the ETH February 12, 2016 Lecturer: Michael Lampis 1 Reminder: FPT algorithms Definition 1. A parameterized problem is a function from (χ, k) {0, 1} N to {0,
More informationNotes for Lecture 24
U.C. Berkeley CS170: Intro to CS Theory Handout N24 Professor Luca Trevisan December 4, 2001 Notes for Lecture 24 1 Some NP-complete Numerical Problems 1.1 Subset Sum The Subset Sum problem is defined
More informationChapter 11. Network Community Detection
Chapter 11. Network Community Detection Wei Pan Division of Biostatistics, School of Public Health, University of Minnesota, Minneapolis, MN 55455 Email: weip@biostat.umn.edu PubH 7475/8475 c Wei Pan Outline
More informationAC-Close: Efficiently Mining Approximate Closed Itemsets by Core Pattern Recovery
: Efficiently Mining Approximate Closed Itemsets by Core Pattern Recovery Hong Cheng Philip S. Yu Jiawei Han University of Illinois at Urbana-Champaign IBM T. J. Watson Research Center {hcheng3, hanj}@cs.uiuc.edu,
More informationCharacterizing Improving Directions Unconstrained Optimization
Final Review IE417 In the Beginning... In the beginning, Weierstrass's theorem said that a continuous function achieves a minimum on a compact set. Using this, we showed that for a convex set S and y not
More informationA Parallel Primal-Dual Interior-Point Method for Semidefinite Programs Using Positive Definite Matrix Completion
Research Reports on Mathematical and Computing Sciences Series B : Operations Research Department of Mathematical and Computing Sciences Tokyo Institute of Technology 2-12-1 Oh-Okayama, Meguro-ku, Tokyo
More information6 Randomized rounding of semidefinite programs
6 Randomized rounding of semidefinite programs We now turn to a new tool which gives substantially improved performance guarantees for some problems We now show how nonlinear programming relaxations can
More informationRepetition: Primal Dual for Set Cover
Repetition: Primal Dual for Set Cover Primal Relaxation: k min i=1 w ix i s.t. u U i:u S i x i 1 i {1,..., k} x i 0 Dual Formulation: max u U y u s.t. i {1,..., k} u:u S i y u w i y u 0 Harald Räcke 428
More informationLecture 3: Totally Unimodularity and Network Flows
Lecture 3: Totally Unimodularity and Network Flows (3 units) Outline Properties of Easy Problems Totally Unimodular Matrix Minimum Cost Network Flows Dijkstra Algorithm for Shortest Path Problem Ford-Fulkerson
More information1 The Traveling Salesperson Problem (TSP)
CS 598CSC: Approximation Algorithms Lecture date: January 23, 2009 Instructor: Chandra Chekuri Scribe: Sungjin Im In the previous lecture, we had a quick overview of several basic aspects of approximation
More informationSingle Video Performance Analysis for Video-on-Demand Systems
Single Video Performance Analysis for Video-on-Demand Systems James Y. Yang Department of ECE Coordinated Science Laboratory University of Illinois at Urbana-Champaign 138 W Main Street Urbana, IL 6181
More informationA NETWORK SIMPLEX ALGORITHM FOR SOLVING THE MINIMUM DISTRIBUTION COST PROBLEM. I-Lin Wang and Shiou-Jie Lin. (Communicated by Shu-Cherng Fang)
JOURNAL OF INDUSTRIAL AND doi:10.3934/jimo.2009.5.929 MANAGEMENT OPTIMIZATION Volume 5, Number 4, November 2009 pp. 929 950 A NETWORK SIMPLEX ALGORITHM FOR SOLVING THE MINIMUM DISTRIBUTION COST PROBLEM
More informationSuperconcentrators of depth 2 and 3; odd levels help (rarely)
Superconcentrators of depth 2 and 3; odd levels help (rarely) Noga Alon Bellcore, Morristown, NJ, 07960, USA and Department of Mathematics Raymond and Beverly Sackler Faculty of Exact Sciences Tel Aviv
More informationCOMP Online Algorithms. Online Bin Packing. Shahin Kamali. Lecture 20 - Nov. 16th, 2017 University of Manitoba
COMP 7720 - Online Algorithms Online Bin Packing Shahin Kamali Lecture 20 - Nov. 16th, 2017 University of Manitoba COMP 7720 - Online Algorithms Online Bin Packing 1 / 24 Review & Plan COMP 7720 - Online
More informationAn O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem
An O(log n/ log log n)-approximation Algorithm for the Asymmetric Traveling Salesman Problem and more recent developments CATS @ UMD April 22, 2016 The Asymmetric Traveling Salesman Problem (ATSP) Problem
More informationWeek 5. Convex Optimization
Week 5. Convex Optimization Lecturer: Prof. Santosh Vempala Scribe: Xin Wang, Zihao Li Feb. 9 and, 206 Week 5. Convex Optimization. The convex optimization formulation A general optimization problem is
More informationCooperative Computing for Autonomous Data Centers
Cooperative Computing for Autonomous Data Centers Jared Saia (U. New Mexico) Joint with: Jon Berry, Cindy Phillips (Sandia Labs), Aaron Kearns (U. New Mexico) Outline 1) Bounding clustering coefficients
More informationData-Driven Geometry Processing Map Synchronization I. Qixing Huang Nov. 28 th 2018
Data-Driven Geometry Processing Map Synchronization I Qixing Huang Nov. 28 th 2018 Shape matching Affine Applications Shape reconstruction Transfer information Aggregate information Protein docking Pair-wise
More informationAlgebraic statistics for network models
Algebraic statistics for network models Connecting statistics, combinatorics, and computational algebra Part One Sonja Petrović (Statistics Department, Pennsylvania State University) Applied Mathematics
More informationClustering and The Expectation-Maximization Algorithm
Clustering and The Expectation-Maximization Algorithm Unsupervised Learning Marek Petrik 3/7 Some of the figures in this presentation are taken from An Introduction to Statistical Learning, with applications
More informationarxiv: v2 [cs.ds] 21 Mar 2010
HITTING DIAMONDS AND GROWING CACTI SAMUEL FIORINI, GWENAËL JORET, AND UGO PIETROPAOLI arxiv:0911.4366v2 [cs.ds] 21 Mar 2010 Abstract. We consider the following NP-hard problem: in a weighted graph, find
More informationCS 473: Algorithms. Ruta Mehta. Spring University of Illinois, Urbana-Champaign. Ruta (UIUC) CS473 1 Spring / 36
CS 473: Algorithms Ruta Mehta University of Illinois, Urbana-Champaign Spring 2018 Ruta (UIUC) CS473 1 Spring 2018 1 / 36 CS 473: Algorithms, Spring 2018 LP Duality Lecture 20 April 3, 2018 Some of the
More informationarxiv: v1 [math.co] 28 Sep 2010
Densities of Minor-Closed Graph Families David Eppstein Computer Science Department University of California, Irvine Irvine, California, USA arxiv:1009.5633v1 [math.co] 28 Sep 2010 September 3, 2018 Abstract
More informationMathematical Programming and Research Methods (Part II)
Mathematical Programming and Research Methods (Part II) 4. Convexity and Optimization Massimiliano Pontil (based on previous lecture by Andreas Argyriou) 1 Today s Plan Convex sets and functions Types
More informationAutomated Precision Tuning using Semidefinite Programming
Automated Precision Tuning using Semidefinite Programming Victor Magron, RA Imperial College joint work with G. Constantinides and A. Donaldson British-French-German Conference on Optimization 15 June
More informationApproximate Nearest Neighbor Problem: Improving Query Time CS468, 10/9/2006
Approximate Nearest Neighbor Problem: Improving Query Time CS468, 10/9/2006 Outline Reducing the constant from O ( ɛ d) to O ( ɛ (d 1)/2) in uery time Need to know ɛ ahead of time Preprocessing time and
More informationHardness of Subgraph and Supergraph Problems in c-tournaments
Hardness of Subgraph and Supergraph Problems in c-tournaments Kanthi K Sarpatwar 1 and N.S. Narayanaswamy 1 Department of Computer Science and Engineering, IIT madras, Chennai 600036, India kanthik@gmail.com,swamy@cse.iitm.ac.in
More informationEnclosures of Roundoff Errors using SDP
Enclosures of Roundoff Errors using SDP Victor Magron, CNRS Jointly Certified Upper Bounds with G. Constantinides and A. Donaldson Metalibm workshop: Elementary functions, digital filters and beyond 12-13
More informationConvex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes
Convex hulls of spheres and convex hulls of convex polytopes lying on parallel hyperplanes Menelaos I. Karavelas joint work with Eleni Tzanaki University of Crete & FO.R.T.H. OrbiCG/ Workshop on Computational
More informationSFI Talk. Lev Reyzin Yahoo! Research (work done while at Yale University) talk based on 2 papers, both with Dana Angluin and James Aspnes
SFI Talk Lev Reyzin Yahoo! Research (work done while at Yale University) talk based on 2 papers, both with Dana Angluin and James Aspnes 1 Reconstructing Evolutionary Trees via Distance Experiments Learning
More informationMathematical and Algorithmic Foundations Linear Programming and Matchings
Adavnced Algorithms Lectures Mathematical and Algorithmic Foundations Linear Programming and Matchings Paul G. Spirakis Department of Computer Science University of Patras and Liverpool Paul G. Spirakis
More informationSolving SDPs for synchronization and MaxCut problems via the Grothendieck inequality
Solving SDPs for synchronization and MaxCut problems via the Grothendieck inequality Song Mei Stanford University July 8, 2017 Joint work with Theodor Misiakiewicz, Andrea Montanari, and Roberto I. Oliveira
More informationPreferential attachment models and their generalizations
Preferential attachment models and their generalizations Liudmila Ostroumova, Andrei Raigorodskii Yandex Lomonosov Moscow State University Moscow Institute of Physics and Technology June, 2013 Experimental
More informationK-Means and Gaussian Mixture Models
K-Means and Gaussian Mixture Models David Rosenberg New York University June 15, 2015 David Rosenberg (New York University) DS-GA 1003 June 15, 2015 1 / 43 K-Means Clustering Example: Old Faithful Geyser
More informationEpistemic/Non-probabilistic Uncertainty Propagation Using Fuzzy Sets
Epistemic/Non-probabilistic Uncertainty Propagation Using Fuzzy Sets Dongbin Xiu Department of Mathematics, and Scientific Computing and Imaging (SCI) Institute University of Utah Outline Introduction
More informationThe extendability of matchings in strongly regular graphs
The extendability of matchings in strongly regular graphs Sebastian Cioabă Department of Mathematical Sciences University of Delaware Villanova, June 5, 2014 Introduction Matching A set of edges M of a
More informationMonotone Paths in Geometric Triangulations
Monotone Paths in Geometric Triangulations Adrian Dumitrescu Ritankar Mandal Csaba D. Tóth November 19, 2017 Abstract (I) We prove that the (maximum) number of monotone paths in a geometric triangulation
More informationML Detection via SDP Relaxation
ML Detection via SDP Relaxation Junxiao Song and Daniel P. Palomar The Hong Kong University of Science and Technology (HKUST) ELEC 5470 - Convex Optimization Fall 2017-18, HKUST, Hong Kong Outline of Lecture
More informationOn Rainbow Cycles in Edge Colored Complete Graphs. S. Akbari, O. Etesami, H. Mahini, M. Mahmoody. Abstract
On Rainbow Cycles in Edge Colored Complete Graphs S. Akbari, O. Etesami, H. Mahini, M. Mahmoody Abstract In this paper we consider optimal edge colored complete graphs. We show that in any optimal edge
More informationHONOM EUROPEAN WORKSHOP on High Order Nonlinear Numerical Methods for Evolutionary PDEs, Bordeaux, March 18-22, 2013
HONOM 2013 EUROPEAN WORKSHOP on High Order Nonlinear Numerical Methods for Evolutionary PDEs, Bordeaux, March 18-22, 2013 A priori-based mesh adaptation for third-order accurate Euler simulation Alexandre
More informationClustering. (Part 2)
Clustering (Part 2) 1 k-means clustering 2 General Observations on k-means clustering In essence, k-means clustering aims at minimizing cluster variance. It is typically used in Euclidean spaces and works
More informationCS 580: Algorithm Design and Analysis. Jeremiah Blocki Purdue University Spring 2018
CS 580: Algorithm Design and Analysis Jeremiah Blocki Purdue University Spring 2018 Recap: Stable Matching Problem Definition of a Stable Matching Stable Roomate Matching Problem Stable matching does not
More informationColoring 3-colorable Graphs
Coloring 3-colorable Graphs Pawan Kumar Aurora Advised by Prof. Shashank K Mehta Department of Computer Science and Engineering Indian Institute of Technology, Kanpur State of the Art Seminar k-coloring
More informationE-Companion: On Styles in Product Design: An Analysis of US. Design Patents
E-Companion: On Styles in Product Design: An Analysis of US Design Patents 1 PART A: FORMALIZING THE DEFINITION OF STYLES A.1 Styles as categories of designs of similar form Our task involves categorizing
More informationBilevel Sparse Coding
Adobe Research 345 Park Ave, San Jose, CA Mar 15, 2013 Outline 1 2 The learning model The learning algorithm 3 4 Sparse Modeling Many types of sensory data, e.g., images and audio, are in high-dimensional
More informationLecture and notes by: Sarah Fletcher and Michael Xu November 3rd, Multicommodity Flow
Multicommodity Flow 1 Introduction Suppose we have a company with a factory s and a warehouse t. The quantity of goods that they can ship from the factory to the warehouse in a given time period is limited
More informationNo more questions will be added
CSC 2545, Spring 2017 Kernel Methods and Support Vector Machines Assignment 2 Due at the start of class, at 2:10pm, Thurs March 23. No late assignments will be accepted. The material you hand in should
More informationSpeeding up Correlation Search for Binary Data
Speeding up Correlation Search for Binary Data Lian Duan and W. Nick Street lian-duan@uiowa.edu Management Sciences Department The University of Iowa Abstract Finding the most interesting correlations
More informationOptimization and approximation on systems of geometric objects van Leeuwen, E.J.
UvA-DARE (Digital Academic Repository) Optimization and approximation on systems of geometric objects van Leeuwen, E.J. Link to publication Citation for published version (APA): van Leeuwen, E. J. (2009).
More informationNetworks and Algebraic Statistics
Networks and Algebraic Statistics Dane Wilburne Illinois Institute of Technology UC Davis CACAO Seminar Davis, CA October 4th, 2016 dwilburne@hawk.iit.edu (IIT) Networks and Alg. Stat. Oct. 2016 1 / 23
More informationOn linear and semidefinite programming relaxations for hypergraph matching
Math. Program., Ser. A DOI 10.1007/s10107-011-0451-5 FULL LENGTH PAPER On linear and semidefinite programming relaxations for hypergraph matching Yuk Hei Chan Lap Chi Lau Received: November 009 / Accepted:
More informationLEARNING CIRCUITS AND NETWORKS BY INJECTING VALUES. Lev Reyzin Yale University
LEARNING CIRCUITS AND NETWORKS BY INJECTING VALUES Lev Reyzin Yale University PAPERS Dana Angluin, James Aspnes, Jiang Chen, and Yinghua Wu. Learning a Circuit by Injecting Values. In Proceedings of the
More informationINTRODUCTION. An easy way to express the idea of an algorithm (very much like C/C++, Java, Pascal, Ada, )
INTRODUCTION Objective: - Algorithms - Techniques - Analysis. Algorithms: Definition: Pseudocode: An algorithm is a sequence of computational steps that tae some value, or set of values, as input and produce
More informationOptimal Parallel Randomized Renaming
Optimal Parallel Randomized Renaming Martin Farach S. Muthukrishnan September 11, 1995 Abstract We consider the Renaming Problem, a basic processing step in string algorithms, for which we give a simultaneously
More informationAll-Pairs Nearly 2-Approximate Shortest-Paths in O(n 2 polylog n) Time
All-Pairs Nearly 2-Approximate Shortest-Paths in O(n 2 polylog n) Time Surender Baswana 1, Vishrut Goyal 2, and Sandeep Sen 3 1 Max-Planck-Institut für Informatik, Saarbrücken, Germany. sbaswana@mpi-sb.mpg.de
More informationClustering: K-means and Kernel K-means
Clustering: K-means and Kernel K-means Piyush Rai Machine Learning (CS771A) Aug 31, 2016 Machine Learning (CS771A) Clustering: K-means and Kernel K-means 1 Clustering Usually an unsupervised learning problem
More informationSegmentation: Clustering, Graph Cut and EM
Segmentation: Clustering, Graph Cut and EM Ying Wu Electrical Engineering and Computer Science Northwestern University, Evanston, IL 60208 yingwu@northwestern.edu http://www.eecs.northwestern.edu/~yingwu
More informationLecture 16: Gaps for Max-Cut
Advanced Approximation Algorithms (CMU 8-854B, Spring 008) Lecture 6: Gaps for Max-Cut Mar 6, 008 Lecturer: Ryan O Donnell Scribe: Ravishankar Krishnaswamy Outline In this lecture, we will discuss algorithmic
More informationOn the Impact of Mobility on Multicast Capacity of Wireless Networks
On the Impact of Mobility on Multicast Capacity of Wireless Networs Jubin Jose, Ahmed Abdel-Hadi, Piyush Gupta and Sriram Vishwanath University of Texas at Austin, Austin, TX Bell Labs, Alcatel-Lucent,
More informationIntroduction to Topics in Machine Learning
Introduction to Topics in Machine Learning Namrata Vaswani Department of Electrical and Computer Engineering Iowa State University Namrata Vaswani 1/ 27 Compressed Sensing / Sparse Recovery: Given y :=
More informationInterpolation & Polynomial Approximation. Cubic Spline Interpolation II
Interpolation & Polynomial Approximation Cubic Spline Interpolation II Numerical Analysis (9th Edition) R L Burden & J D Faires Beamer Presentation Slides prepared by John Carroll Dublin City University
More informationPCP and Hardness of Approximation
PCP and Hardness of Approximation January 30, 2009 Our goal herein is to define and prove basic concepts regarding hardness of approximation. We will state but obviously not prove a PCP theorem as a starting
More informationA combination of clustering algorithms with Ant Colony Optimization for large clustered Euclidean Travelling Salesman Problem
A combination of clustering algorithms with Ant Colony Optimization for large clustered Euclidean Travelling Salesman Problem TRUNG HOANG DINH, ABDULLAH AL MAMUN Department of Electrical and Computer Engineering
More informationNon-exhaustive, Overlapping k-means
Non-exhaustive, Overlapping k-means J. J. Whang, I. S. Dhilon, and D. F. Gleich Teresa Lebair University of Maryland, Baltimore County October 29th, 2015 Teresa Lebair UMBC 1/38 Outline Introduction NEO-K-Means
More informationNew Directions in Linear Programming
New Directions in Linear Programming Robert Vanderbei November 5, 2001 INFORMS Miami Beach NOTE: This is a talk mostly on pedagogy. There will be some new results. It is not a talk on state-of-the-art
More informationA Dendrogram. Bioinformatics (Lec 17)
A Dendrogram 3/15/05 1 Hierarchical Clustering [Johnson, SC, 1967] Given n points in R d, compute the distance between every pair of points While (not done) Pick closest pair of points s i and s j and
More informationA Geometric Analysis of Subspace Clustering with Outliers
A Geometric Analysis of Subspace Clustering with Outliers Mahdi Soltanolkotabi and Emmanuel Candés Stanford University Fundamental Tool in Data Mining : PCA Fundamental Tool in Data Mining : PCA Subspace
More information