Mathematics & Optimization

Global Convergence and Variance Reduction for a Class of Nonconvex-Nonconcave Minimax Problems NeurIPS 2020 Global Greedy Dependency Parsing AAAI 2020 Globally Optimal Contrast Maximisation for Event-Based Motion Estimation CVPR 2020 Global Optimality for Point Set Registration Using Semidefinite Programming CVPR 2020 GOBNILP: Learning Bayesian network structure with integer programming PGM 2020 Goodness-of-Fit Tests for Inhomogeneous Random Graphs ICML 2020 Gradient Boosts the Approximate Vanishing Ideal AAAI 2020 Gradient descent algorithms for Bures-Wasserstein barycenters COLT 2020 Gradient Descent for Sparse Rank-One Matrix Completion for Crowd-Sourced Aggregation of Sparsely Interacting Workers JMLR 2020 Gradient-free Online Learning in Continuous Games with Delayed Rewards ICML 2020 Gradientless Descent: High-Dimensional Zeroth-Order Optimization ICLR 2020 Gradient Method for Continuous Influence Maximization with Budget-Saving Considerations AAAI 2020 Gradient Perturbation is Underrated for Differentially Private Convex Optimization IJCAI 2020 Graduated Assignment for Joint Multi-Graph Matching and Clustering with Application to Unsupervised Graph Matching Network Learning NeurIPS 2020 Graph Coarsening with Preserved Spectral Properties AISTATS 2020 Graph-Dependent Implicit Regularisation for Distributed Stochastic Subgradient Descent JMLR 2020 Graph Filtration Learning ICML 2020 Graphical continuous Lyapunov models UAI 2020 Graph Neural Networks Meet Neural-Symbolic Computing: A Survey and Perspective IJCAI 2020 Graph Structure of Neural Networks ICML 2020 Greed Meets Sparsity: Understanding and Improving Greedy Coordinate Descent for Sparse Optimization AISTATS 2020 Greedy Convex Ensemble IJCAI 2020 Gromov-Wasserstein Factorization Models for Graph Clustering AAAI 2020 Group-Fair Online Allocation in Continuous Time NeurIPS 2020 Guaranteed Validity for Empirical Approaches to Adaptive Data Analysis AISTATS 2020