Mathematics & Optimization

Hardness of Online Sleeping Combinatorial Optimization Problems NeurIPS 2016 Hawkes Processes with Stochastic Excitations ICML 2016 Heteroscedastic Sequences: Beyond Gaussianity ICML 2016 Hierarchical Clustering via Spreading Metrics NeurIPS 2016 High Dimensional Bayesian Optimization via Restricted Projection Pursuit Models AISTATS 2016 High Dimensional Structured Superposition Models NeurIPS 2016 Highly-Smooth Zero-th Order Online Optimization COLT 2016 High-Rank Matrix Completion and Clustering under Self-Expressive Models NeurIPS 2016 Highway Vehicle Counting in Compressed Domain CVPR 2016 Homography Estimation From the Common Self-Polar Triangle of Separate Ellipses CVPR 2016 Homotopy Smoothing for Non-Smooth Problems with Lower Complexity than O(1/ε) NeurIPS 2016 Horizontally Scalable Submodular Maximization ICML 2016 How to calculate partition functions using convex programming hierarchies: provable bounds for variational methods COLT 2016 How to Fake Multiply by a Gaussian Matrix ICML 2016 How to Learn a Graph from Smooth Signals AISTATS 2016 Hybrid Accelerated Optimization for Speech Recognition Interspeech 2016 Hyperparameter optimization with approximate gradient ICML 2016 Identification and Overidentification of Linear Structural Equation Models NeurIPS 2016 Identifying the irreducible disjoint factors of a multivariate probability distribution PGM 2016 Importance Weighting Without Importance Weights: An Efficient Algorithm for Combinatorial Semi-Bandits JMLR 2016 Improved Error Bounds for Tree Representations of Metric Spaces NeurIPS 2016 Improved Hamming Distance Search Using Variable Length Substrings CVPR 2016 Improved Learning Complexity in Combinatorial Pure Exploration Bandits AISTATS 2016 Improved Regret Bounds for Oracle-Based Adversarial Contextual Bandits NeurIPS 2016 Improved SVRG for Non-Strongly-Convex or Sum-of-Non-Convex Objectives ICML 2016