Skip to content
conftrace_

Papers (including subtopics)

On the Convergence of Gaussian Belief Propagation with Nodes of Arbitrary Size JMLR 2019 On the convergence of single-call stochastic extra-gradient methods NeurIPS 2019 On the Convergence of (Stochastic) Gradient Descent with Extrapolation for Non-Convex Minimization IJCAI 2019 On the Curved Geometry of Accelerated Optimization NeurIPS 2019 On the Efficiency and Equilibria of Rich Ads IJCAI 2019 On the Global Convergence of (Fast) Incremental Expectation Maximization Methods NeurIPS 2019 On the Hardness of Probabilistic Inference Relaxations AAAI 2019 On the Integration of CP-nets in ASPRIN IJCAI 2019 On the number of variables to use in principal component regression NeurIPS 2019 On the Optimality of Perturbations in Stochastic and Adversarial Multi-armed Bandit Problems NeurIPS 2019 On the optimality of the Hedge algorithm in the stochastic regime JMLR 2019 On the Problem of Assigning PhD Grants IJCAI 2019 On the Proximity of Markets with Integral Equilibria AAAI 2019 On the Time Complexity of Algorithm Selection Hyper-Heuristics for Multimodal Optimisation AAAI 2019 Ontology Approximation in Horn Description Logics IJCAI 2019 On two ways to use determinantal point processes for Monte Carlo integration NeurIPS 2019 Open Problem: Do Good Algorithms Necessarily Query Bad Points? COLT 2019 Open Problem: The Oracle Complexity of Convex Optimization with Limited Memory COLT 2019 Optimal Algorithms for Lipschitz Bandits with Heavy-tailed Rewards ICML 2019 Optimal Analysis of Subset-Selection Based L_p Low-Rank Approximation NeurIPS 2019 Optimal Auctions through Deep Learning ICML 2019 Optimal Continuous DR-Submodular Maximization and Applications to Provable Mean Field Inference ICML 2019 Optimal Convergence Rates for Convex Distributed Optimization in Networks JMLR 2019 Optimal Dynamic Auctions Are Virtual Welfare Maximizers AAAI 2019 Optimal Interdiction of Urban Criminals with the Aid of Real-Time Information AAAI 2019