| Conic Descent and its Application to Memory-efficient Optimization over Positive Semidefinite Matrices
|
2021 |
Duchi, John C |
| Targeted Adversarial Perturbations for Monocular Depth Prediction
|
2021 |
Wong, Alex |
| Beyond the Mean-Field: Structured Deep Gaussian Processes Improve the Predictive Uncertainties
|
2021 |
Lindinger, Jakob |
| Multi-Fidelity Bayesian Optimization via Deep Neural Networks
|
2021 |
Li, Shibo |
| Optimal Prediction of the Number of Unseen Species with Multiplicity
|
2021 |
Hao, Yi |
| Curriculum Learning by Dynamic Instance Hardness
|
2021 |
Zhou, Tianyi |
| Fast, Accurate, and Simple Models for Tabular Data via Augmented Distillation
|
2021 |
Fakoor, Rasool |
| AdaShare: Learning What To Share For Efficient Deep Multi-Task Learning
|
2021 |
Sun, Ximeng |
| COT-GAN: Generating Sequential Data via Causal Optimal Transport
|
2021 |
Xu, Tianlin |
| Impossibility Results for Grammar-Compressed Linear Algebra
|
2021 |
Abboud, Amir |
| PEP: Parameter Ensembling by Perturbation
|
2021 |
Mehrtash, Alireza |
| Provably Efficient Neural Estimation of Structural Equation Models: An Adversarial Approach
|
2021 |
Liao, Luofeng |
| Learning to Play Sequential Games versus Unknown Opponents
|
2021 |
Sessa, Pier Giuseppe |
| Bridging Imagination and Reality for Model-Based Deep Reinforcement Learning
|
2021 |
Zhu, Guangxiang |
| Exploiting Higher Order Smoothness in Derivative-free Optimization and Continuous Bandits
|
2021 |
Akhavan, Arya |
| Towards a Combinatorial Characterization of Bounded-Memory Learning
|
2021 |
Gonen, Alon |
| Is Long Horizon RL More Difficult Than Short Horizon RL?
|
2021 |
Wang, Ruosong |
| Greedy inference with structure-exploiting lazy maps
|
2021 |
Brennan, Michael |
| Reinforced Molecular Optimization with Neighborhood-Controlled Grammars
|
2021 |
Xu, Chencheng |
| Classification Under Misspecification: Halfspaces, Generalized Linear Models, and Evolvability
|
2021 |
Chen, Sitan |
Tag hinzufügen