Skip to content
conftrace_

Papers (including subtopics)

Projection & Probability-Driven Black-Box Attack CVPR 2020 Projective Preferential Bayesian Optimization ICML 2020 Proper Learning, Helly Number, and an Optimal SVM Bound COLT 2020 Prophet Inequalities for Bayesian Persuasion IJCAI 2020 Prophets, Secretaries, and Maximizing the Probability of Choosing the Best AISTATS 2020 Proportionality in Approval-Based Elections With a Variable Number of Winners IJCAI 2020 Protean: VM Allocation Service at Scale OSDI 2020 Protecting Geolocation Privacy of Photo Collections AAAI 2020 Provable Benefit of Orthogonal Initialization in Optimizing Deep Linear Networks ICLR 2020 Provable Convex Co-clustering of Tensors JMLR 2020 Provable guarantees for decision tree induction: the agnostic setting ICML 2020 Provable Online CP/PARAFAC Decomposition of a Structured Tensor via Dictionary Learning NeurIPS 2020 Provable robustness against all adversarial l_p-perturbations for p≥ 1 ICLR 2020 Provable Smoothness Guarantees for Black-Box Variational Inference ICML 2020 Provably adaptive reinforcement learning in metric spaces NeurIPS 2020 Provably Convergent Two-Timescale Off-Policy Actor-Critic with Function Approximation ICML 2020 Provably Efficient Exploration for Reinforcement Learning Using Unsupervised Learning NeurIPS 2020 Provably Efficient Exploration in Policy Optimization ICML 2020 Provably Efficient Model-based Policy Adaptation ICML 2020 Provably Efficient Neural Estimation of Structural Equation Models: An Adversarial Approach NeurIPS 2020 Provably Efficient Neural GTD for Off-Policy Learning NeurIPS 2020 Provably Efficient Online Hyperparameter Optimization with Population-Based Bandits NeurIPS 2020 Provably Efficient Reinforcement Learning with Kernel and Neural Function Approximations NeurIPS 2020 Provably efficient reinforcement learning with linear function approximation COLT 2020 Provably Efficient Reward-Agnostic Navigation with Linear Value Iteration NeurIPS 2020