Skip to content
conftrace_

Papers (including subtopics)

Provably efficient, succinct, and precise explanations NeurIPS 2021 Provably End-to-end Label-noise Learning without Anchor Points ICML 2021 Provably Faster Algorithms for Bilevel Optimization NeurIPS 2021 Provably Good Solutions to the Knapsack Problem via Neural Networks of Bounded Size AAAI 2021 Provably Safe PAC-MDP Exploration Using Analogies AISTATS 2021 Provably Sample Efficient Reinforcement Learning in Competitive Linear Quadratic Systems L4DC 2021 Provably Strict Generalisation Benefit for Equivariant Models ICML 2021 Provably Strict Generalisation Benefit for Invariance in Kernel Methods NeurIPS 2021 Proximal Causal Learning with Kernels: Two-Stage Estimation and Moment Restriction ICML 2021 Proximal Gradient Descent-Ascent: Variable Convergence under KŁ Geometry ICLR 2021 Proxy Convexity: A Unified Framework for the Analysis of Neural Networks Trained by Gradient Descent NeurIPS 2021 pRSL: Interpretable multi-label stacking by learning probabilistic rules UAI 2021 Pruning Neural Networks at Initialization: Why Are We Missing the Mark? ICLR 2021 Pruning Randomly Initialized Neural Networks with Iterative Randomization NeurIPS 2021 Pseudo-Marginal Hamiltonian Monte Carlo JMLR 2021 Pseudo-Spherical Contrastive Divergence NeurIPS 2021 PSRR-MaxpoolNMS: Pyramid Shifted MaxpoolNMS With Relationship Recovery CVPR 2021 Pure Exploration in Kernel and Neural Bandits NeurIPS 2021 Putting a Compass on the Map of Elections IJCAI 2021 Putting the “Learning" into Learning-Augmented Algorithms for Frequency Estimation ICML 2021 PyKEEN 1.0: A Python Library for Training and Evaluating Knowledge Graph Embeddings JMLR 2021 Pyramid Architecture Search for Real-Time Image Deblurring ICCV 2021 QISTA-Net-Audio: Audio Super-Resolution via Non-Convex ℓ_q-Norm Minimization Interspeech 2021 Q-learning with Logarithmic Regret AISTATS 2021 q-Paths: Generalizing the geometric annealing path using power means UAI 2021