Mathematics & Optimization

Exact and approximate hierarchical clustering using A* UAI 2021 Exact Recovery of Clusters in Finite Metric Spaces Using Oracle Queries COLT 2021 Expanding Boundaries of Gap Safe Screening JMLR 2021 Experimental Design for Regret Minimization in Linear Bandits AISTATS 2021 Expert advice problem with noisy low rank loss ACML 2021 Explicit loss asymptotics in the gradient descent training of neural networks NeurIPS 2021 Exploiting Chain Rule and Bayes' Theorem to Compare Probability Distributions NeurIPS 2021 Exploiting Local Convergence of Quasi-Newton Methods Globally: Adaptive Sample Size Approach NeurIPS 2021 Exploiting Sparsity for Neural Network Verification L4DC 2021 Exploration-Exploitation in Multi-Agent Learning: Catastrophe Theory Meets Game Theory AAAI 2021 Exponential Convergence Rates of Classification Errors on Learning with SGD and Random Features AISTATS 2021 Exponentially Improved Dimensionality Reduction for l1: Subspace Embeddings and Independence Testing COLT 2021 Exponential Reduction in Sample Complexity with Learning of Ising Model Dynamics ICML 2021 Extendability of causal graphical models: Algorithms and computational complexity UAI 2021 Extensions of Karger's Algorithm: Why They Fail in Theory and How They Are Useful in Practice ICCV 2021 Extreme k-Center Clustering AAAI 2021 Fabula Entropy Indexing: Objective Measures of Story Coherence NAACL 2021 Facility’s Perspective to Fair Facility Location Problems AAAI 2021 FACS: Fast Code-based Algorithm for Coalition Structure Generation (Student Abstract) AAAI 2021 Factor-analytic inverse regression for high-dimension, small-sample dimensionality reduction ICML 2021 Fair Algorithms for Multi-Agent Multi-Armed Bandits NeurIPS 2021 Fair and Efficient Allocations under Lexicographic Preferences AAAI 2021 Fair and Efficient Allocations under Subadditive Valuations AAAI 2021 Fair and Efficient Allocations with Limited Demands AAAI 2021 Fair and Efficient Online Allocations with Normalized Valuations AAAI 2021