Optimization

Monge blunts Bayes: Hardness Results for Adversarial Training ICML 2019 Mono3D++: Monocular 3D Vehicle Detection with Two-Scale 3D Hypotheses and Task Priors AAAI 2019 Moving Object Detection Under Discontinuous Change in Illumination Using Tensor Low-Rank and Invariant Sparse Decomposition CVPR 2019 Multiclass Boosting: Margins, Codewords, Losses, and Algorithms JMLR 2019 Multi-Criteria Dimensionality Reduction with Applications to Fairness NeurIPS 2019 Multi-Fidelity Automatic Hyper-Parameter Tuning via Transfer Series Expansion AAAI 2019 Multigoal Committee Selection IJCAI 2019 Multilabel reductions: what is my loss optimising? NeurIPS 2019 Multinomial Distribution Learning for Effective Neural Architecture Search ICCV 2019 Multi-objective Bayesian optimisation with preferences over objectives NeurIPS 2019 Multi-Order Information for Working Set Selection of Sequential Minimal Optimization AISTATS 2019 Multiplicative Sparse Feature Decomposition for Efficient Multi-View Multi-Task Learning IJCAI 2019 Multiplicative Weights Updates as a distributed constrained optimization algorithm: Convergence to second-order stationary points almost always ICML 2019 Multiscale Gaussian Process Level Set Estimation AISTATS 2019 Multivariate Distributionally Robust Convex Regression under Absolute Error Loss NeurIPS 2019 Multivariate Time Series Prediction Based on Optimized Temporal Convolutional Networks with Stacked Auto-encoders ACML 2019 Multi-view Clustering via Late Fusion Alignment Maximization IJCAI 2019 Multi-View Multi-Label Learning with View-Specific Information Extraction IJCAI 2019 muSSP: Efficient Min-cost Flow Algorithm for Multi-object Tracking NeurIPS 2019 MVSCRF: Learning Multi-View Stereo With Conditional Random Fields ICCV 2019 NAS-FPN: Learning Scalable Feature Pyramid Architecture for Object Detection CVPR 2019 NATTACK: Learning the Distributions of Adversarial Examples for an Improved Black-Box Attack on Deep Neural Networks ICML 2019 Natural Option Critic AAAI 2019 Near Optimal Algorithms for Hard Submodular Programs with Discounted Cooperative Costs AISTATS 2019 Near-optimal method for highly smooth convex optimization COLT 2019