Skip to content
conftrace_

Papers (including subtopics)

Finding the bandit in a graph: Sequential search-and-stop AISTATS 2019 Fine-Grained Search Space Classification for Hard Enumeration Variants of Subset Problems AAAI 2019 Finite-Time Error Bounds For Linear Stochastic Approximation andTD Learning COLT 2019 First-Order Algorithms Converge Faster than $O(1/k)$ on Convex Problems ICML 2019 First-order methods almost always avoid saddle points: The case of vanishing step-sizes NeurIPS 2019 Fitting Multiple Heterogeneous Models by Multi-Class Cascaded T-Linkage CVPR 2019 Flexible Modeling of Diversity with Strongly Log-Concave Distributions NeurIPS 2019 Forming Probably Stable Communities with Limited Interactions AAAI 2019 FRAME Revisited: An Interpretation View Based on Particle Evolution AAAI 2019 Frontier Search and Plan Reconstruction in Oversubscription Planning AAAI 2019 Fully Dynamic Consistent Facility Location NeurIPS 2019 Fuzzy-Classification Assisted Solution Preselection in Evolutionary Optimization AAAI 2019 GAN-Based Projector for Faster Recovery With Convergence Guarantees in Linear Inverse Problems ICCV 2019 Garbage In, Reward Out: Bootstrapping Exploration in Multi-Armed Bandits ICML 2019 Gaussian Process Optimization with Adaptive Sketching: Scalable and No Regret COLT 2019 Gaussian Regression with Convex Constraints AISTATS 2019 Generalization Error Analysis of Quantized Compressive Learning NeurIPS 2019 Generalized Approximate Survey Propagation for High-Dimensional Estimation ICML 2019 Generalized Distance Bribery AAAI 2019 Generalized Linear Rule Models ICML 2019 Generalized Majorization-Minimization ICML 2019 Generalized Majorization-Minimization for Non-Convex Optimization IJCAI 2019 Generalized Potential Heuristics for Classical Planning IJCAI 2019 Generalized Score Matching for Non-Negative Data JMLR 2019 Generalized Sliced Wasserstein Distances NeurIPS 2019