Skip to content
conftrace_

Papers (including subtopics)

Complexity Guarantees for Polyak Steps with Momentum COLT 2020 Complexity of Finding Stationary Points of Nonconvex Nonsmooth Functions ICML 2020 Computational and Statistical Tradeoffs in Inferring Combinatorial Structures of Ising Model ICML 2020 Computational Aspects of Conditional Minisum Approval Voting in Elections with Interdependent Issues IJCAI 2020 Computing Equilibria in Binary Networked Public Goods Games AAAI 2020 Computing Team-Maxmin Equilibria in Zero-Sum Multiplayer Extensive-Form Games AAAI 2020 Conditional gradient methods for stochastically constrained convex minimization ICML 2020 Conformal Symplectic and Relativistic Optimization NeurIPS 2020 Conic Descent and its Application to Memory-efficient Optimization over Positive Semidefinite Matrices NeurIPS 2020 Conic Optimization for Quadratic Regression Under Sparse Noise JMLR 2020 Consistent recovery threshold of hidden nearest neighbor graphs COLT 2020 Constrained Dynamic Programming and Supervised Penalty Learning Algorithms for Peak Detection in Genomic Data JMLR 2020 Constrained Upper Confidence Reinforcement Learning L4DC 2020 Constructing Minimal Perfect Hash Functions Using SAT Technology AAAI 2020 Constructive Universal High-Dimensional Distribution Generation through Deep ReLU Networks ICML 2020 Contention-Aware Mapping and Scheduling Optimization for NoC-Based MPSoCs (Student Abstract) AAAI 2020 Content Provider Dynamics and Coordination in Recommendation Ecosystems NeurIPS 2020 Contextual Bandits with Continuous Actions: Smoothing, Zooming, and Adapting JMLR 2020 Contextual Combinatorial Volatile Multi-armed Bandit with Adaptive Discretization AISTATS 2020 Contextual Games: Multi-Agent Learning with Side Information NeurIPS 2020 Contextual Reserve Price Optimization in Auctions via Mixed Integer Programming NeurIPS 2020 Contiguous Cake Cutting: Hardness Results and Approximation Algorithms AAAI 2020 Continuous Regularized Wasserstein Barycenters NeurIPS 2020 Continuous Submodular Maximization: Beyond DR-Submodularity NeurIPS 2020 Continuous-time Lower Bounds for Gradient-based Algorithms ICML 2020