Skip to content
conftrace_

Papers (including subtopics)

Problem-dependent Regret Bounds for Online Learning with Feedback Graphs UAI 2019 Procrastinating with Confidence: Near-Optimal, Anytime, Adaptive Algorithm Configuration NeurIPS 2019 Profiles, Proxies, and Assumptions: Decentralized, Communications-Resilient Planning, Allocation, and Scheduling AAAI 2019 Profit-driven Task Assignment in Spatial Crowdsourcing IJCAI 2019 Progressive-X: Efficient, Anytime, Multi-Model Fitting Algorithm ICCV 2019 Projection-Free Bandit Convex Optimization AISTATS 2019 Projection Free Online Learning over Smooth Sets AISTATS 2019 Projection onto Minkowski Sums with Application to Constrained Learning ICML 2019 Proximal Distance Algorithms: Theory and Practice JMLR 2019 Proximal Splitting Meets Variance Reduction AISTATS 2019 Pseudo-Extended Markov chain Monte Carlo NeurIPS 2019 Pure entropic regularization for metrical task systems COLT 2019 Pure Exploration with Multiple Correct Answers NeurIPS 2019 q-means: A quantum algorithm for unsupervised machine learning NeurIPS 2019 Qsparse-local-SGD: Distributed SGD with Quantization, Sparsification and Local Computations NeurIPS 2019 Quadruply Stochastic Gradients for Large Scale Nonlinear Semi-Supervised AUC Optimization IJCAI 2019 Quantile Stein Variational Gradient Descent for Batch Bayesian Optimization ICML 2019 QUARCH: A New Quasi-Affine Reconstruction Stratum From Vague Relative Camera Orientation Knowledge ICCV 2019 Quasi-Perfect Stackelberg Equilibrium AAAI 2019 Query-focused Sentence Compression in Linear Time EMNLP 2019 Radial Distortion Triangulation CVPR 2019 Random Dictators with a Random Referee: Constant Sample Complexity Mechanisms for Social Choice AAAI 2019 Random Feature-based Online Multi-kernel Learning in Environments with Unknown Dynamics JMLR 2019 Randomized Iterative Algorithms for Fisher Discriminant Analysis UAI 2019 Randomized Strategies for Robust Combinatorial Optimization AAAI 2019