Theory

Optimal Bounds between f-Divergences and Integral Probability Metrics JMLR 2021 Optimal Dynamic Regret in Exp-Concave Online Learning COLT 2021 Optimal Estimation of High Dimensional Smooth Additive Function Based on Noisy Observations ICML 2021 Optimality of variational inference for stochasticblock model with missing links NeurIPS 2021 Optimal Regularization can Mitigate Double Descent ICLR 2021 Optimal Uniform OPE and Model-based Offline Reinforcement Learning in Time-Homogeneous, Reward-Free and Task-Agnostic Settings NeurIPS 2021 Oracle Complexity in Nonsmooth Nonconvex Optimization NeurIPS 2021 Orthographic-Perspective Epipolar Geometry ICCV 2021 Outside Computation with Superior Functions NAACL 2021 Parameterized Complexity of Logic-Based Argumentation in Schaefer's Framework AAAI 2021 Parameterized Complexity of Small Decision Tree Learning AAAI 2021 Parametric Complexity Bounds for Approximating PDEs with Neural Networks NeurIPS 2021 Parametric Programming Approach for More Powerful and General Lasso Selective Inference AISTATS 2021 Partial Identifiability in Discrete Data with Measurement Error UAI 2021 Path Length Bounds for Gradient Descent and Flow JMLR 2021 PDE-Driven Spatiotemporal Disentanglement ICLR 2021 PDO-eS2CNNs: Partial Differential Operator Based Equivariant Spherical CNNs AAAI 2021 Persuading Voters in District-based Elections AAAI 2021 Perturbation-based Regret Analysis of Predictive Control in Linear Time Varying Systems NeurIPS 2021 Perturbation Theory for the Information Bottleneck NeurIPS 2021 PoA of Simple Auctions with Interdependent Values AAAI 2021 Policy Analysis using Synthetic Controls in Continuous-Time ICML 2021 Policy Optimization in Adversarial MDPs: Improved Exploration via Dilated Bonuses NeurIPS 2021 Post-selection inference with HSIC-Lasso ICML 2021 Power Constrained Bandits MLHC 2021