Skip to content
conftrace_

Papers (including subtopics)

Asynchronous Stochastic Frank-Wolfe Algorithms for Non-Convex Optimization IJCAI 2019 Athanor: High-Level Local Search Over Abstract Constraint Specifications in Essence IJCAI 2019 A Theoretically Guaranteed Deep Optimization Framework for Robust Compressive Sensing MRI AAAI 2019 A Theory of Regularized Markov Decision Processes ICML 2019 A Theory of Selective Prediction COLT 2019 A Tree-Based Method for Fast Repeated Sampling of Determinantal Point Processes ICML 2019 Attention, Learn to Solve Routing Problems! ICLR 2019 Attribute-efficient learning of monomials over highly-correlated variables ALT 2019 A Two-Individual Based Evolutionary Algorithm for the Flexible Job Shop Scheduling Problem AAAI 2019 A Unified Approach to Online Matching with Conflict-Aware Constraints AAAI 2019 A unified variance-reduced accelerated gradient method for convex optimization NeurIPS 2019 A Unifying Framework for Spectrum-Preserving Graph Sparsification and Coarsening NeurIPS 2019 A Universal Algorithm for Variational Inequalities Adaptive to Smoothness and Noise COLT 2019 A Universally Optimal Multistage Accelerated Stochastic Gradient Method NeurIPS 2019 Autoencoding any Data through Kernel Autoencoders AISTATS 2019 Automatic Construction of Parallel Portfolios via Explicit Instance Grouping AAAI 2019 A Variational Pan-Sharpening With Local Gradient Constraints CVPR 2019 Average Case Column Subset Selection for Entrywise ℓ_1-Norm Loss NeurIPS 2019 A Well-Tempered Landscape for Non-convex Robust Subspace Recovery JMLR 2019 BAD SLAM: Bundle Adjusted Direct RGB-D SLAM CVPR 2019 Balanced Ranking with Diversity Constraints IJCAI 2019 Bandit Online Learning with Unknown Delays AISTATS 2019 Bandits with Feedback Graphs and Switching Costs NeurIPS 2019 Batched Multi-armed Bandits Problem NeurIPS 2019 Batched Stochastic Bayesian Optimization via Combinatorial Constraints Design AISTATS 2019