Mathematics & Optimization

5* Knowledge Graph Embeddings with Projective Transformations AAAI 2021 A Bayesian Framework for Information-Theoretic Probing EMNLP 2021 A Bi-Level Framework for Learning to Solve Combinatorial Optimization on Graphs NeurIPS 2021 A Blind Block Term Decomposition of High Order Tensors AAAI 2021 A/B/n Testing with Control in the Presence of Subpopulations NeurIPS 2021 Absolute Neighbour Difference based Correlation Test for Detecting Heteroscedastic Relationships NeurIPS 2021 Abstract Cores in Implicit Hitting Set MaxSat Solving (Extended Abstract) IJCAI 2021 Abstraction-based branch and bound approach to Q-learning for hybrid optimal control L4DC 2021 Accelerated Algorithms for Smooth Convex-Concave Minimax Problems with O(1/k^2) Rate on Squared Gradient Norm ICML 2021 Accelerated Combinatorial Search for Outlier Detection with Provable Bound on Sub-Optimality AAAI 2021 Accelerated Concurrent Learning Algorithms via Data-Driven Hybrid Dynamics and Nonsmooth ODEs L4DC 2021 Accelerated Learning with Robustness to Adversarial Regressors L4DC 2021 Accelerating Atmospheric Turbulence Simulation via Learned Phase-to-Space Transform ICCV 2021 Accelerating Distributed SGD for Linear Regression using Iterative Pre-Conditioning L4DC 2021 Accelerating Ill-Conditioned Low-Rank Matrix Estimation via Scaled Gradient Descent JMLR 2021 Accelerating Metropolis-Hastings with Lightweight Inference Compilation AISTATS 2021 Acceleration via Fractal Learning Rate Schedules ICML 2021 Accomplice Manipulation of the Deferred Acceptance Algorithm IJCAI 2021 Accumulations of Projections—A Unified Framework for Random Sketches in Kernel Ridge Regression AISTATS 2021 A Central Limit Theorem for Differentially Private Query Answering NeurIPS 2021 Achieving Envy-freeness and Equitability with Monetary Transfers AAAI 2021 Achieving Near Instance-Optimality and Minimax-Optimality in Stochastic and Adversarial Linear Bandits Simultaneously ICML 2021 Achieving Proportionality up to the Maximin Item with Indivisible Goods AAAI 2021 Achieving Robustness in Classification Using Optimal Transport With Hinge Regularization CVPR 2021 A Closer Look at the Worst-case Behavior of Multi-armed Bandit Algorithms NeurIPS 2021