← Optimization
Mathematics & Optimization › Optimization ›

Theory

97 directly classified papers

Papers per year

Papers

Nearly tight sample complexity bounds for learning mixtures of Gaussians via sample compression schemes NIPS 2018
Relating Leverage Scores and Density using Regularized Christoffel Functions NIPS 2018
Approximate Supermodularity Bounds for Experimental Design NIPS 2017
Clustering Stable Instances of Euclidean k-means. NIPS 2017
Generating Context-Free Grammars using Classical Planning IJCAI 2017
Construction of System of Spheres-based Transitively Relational Partial Meet Multiple Contractions: An Impossibility Result (Extended Abstract) IJCAI 2017
New Canonical Representations by Augmenting OBDDs with Conjunctive Decomposition (Extended Abstract) IJCAI 2017
Skip-Gram − Zipf + Uniform = Vector Additivity ACL 2017
Restricted Chase (Non)Termination for Existential Rules with Disjunctions IJCAI 2017
Discriminative State Space Models NIPS 2017
Similarity Metric For Curved Shapes In Euclidean Space CVPR 2016
Refined Lower Bounds for Adversarial Bandits NIPS 2016
Average-case hardness of RIP certification NIPS 2016
Approximate Log-Hilbert-Schmidt Distances Between Covariance Operators for Image Classification CVPR 2016
Optimal Testing for Properties of Distributions NIPS 2015
On the Convergence Rate of Decomposable Submodular Function Minimization NIPS 2014
Sparse Polynomial Learning and Graph Sketching NIPS 2014
Tight Bounds for Influence in Diffusion Networks and Application to Bond Percolation and Epidemiology NIPS 2014
Minimal Solvers for Relative Pose with a Single Unknown Radial Distortion CVPR 2014
Curvature and Optimal Algorithms for Learning and Minimizing Submodular Functions NIPS 2013
Learning Halfspaces with the Zero-One Loss: Time-Accuracy Tradeoffs NIPS 2012
Optimistic Optimization of a Deterministic Function without the Knowledge of its Smoothness NIPS 2011