Mathematics & Optimization

Combining ADMM and the Augmented Lagrangian Method for Efficiently Handling Many Constraints IJCAI 2019 Combining Global Sparse Gradients with Local Gradients in Distributed Neural Network Training EMNLP 2019 Combining Online Learning Guarantees COLT 2019 Communication and Memory Efficient Testing of Discrete Distributions COLT 2019 Communication-Efficient Stochastic Gradient MCMC for Neural Networks AAAI 2019 Communication-Optimal Distributed Dynamic Graph Clustering AAAI 2019 Communication trade-offs for Local-SGD with large step size NeurIPS 2019 Community Focusing: Yet Another Query-Dependent Community Detection AAAI 2019 Comparing distributions: ℓ_1 geometry improves kernel two-sample testing NeurIPS 2019 Comparing EM with GD in Mixture Models of Two Components UAI 2019 Competing Against Nash Equilibria in Adversarially Changing Zero-Sum Games ICML 2019 Competitive Gradient Descent NeurIPS 2019 Competitive ratio vs regret minimization: achieving the best of both worlds ALT 2019 Complete Search for Feature Selection in Decision Trees JMLR 2019 Complexities in Projection-Free Stochastic Non-convex Minimization AISTATS 2019 Complexity of Fundamental Problems in Probabilistic Abstract Argumentation: Beyond Independence (Extended Abstract) IJCAI 2019 Complexity of Highly Parallel Non-Smooth Convex Optimization NeurIPS 2019 Complexity of Manipulating and Controlling Approval-Based Multiwinner Voting IJCAI 2019 Complex Moment-Based Supervised Eigenmap for Dimensionality Reduction AAAI 2019 Composable Core-sets for Determinant Maximization: A Simple Near-Optimal Algorithm ICML 2019 Computational Aspects of Equilibria in Discrete Preference Games IJCAI 2019 Computational Intractability and Solvability for the Birds of a Feather Game AAAI 2019 Computational Separations between Sampling and Optimization NeurIPS 2019 Computation Efficient Coded Linear Transform AISTATS 2019 Computer Generation of Birds of a Feather Puzzles AAAI 2019