| NEAR-OPTIMAL SAMPLE COMPLEXITY BOUNDS FOR LEARNING LATENT K-POLYTOPES AND APPLICATIONS TO AD-MIXTURES
|
2021 |
Bhattacharyya, Chiranjib |
| PROVABLE GUARANTEES FOR DECISION TREE INDUCTION: THE AGNOSTIC SETTING
|
2021 |
Blanc, Guy |
| FAST DIFFERENTIABLE SORTING AND RANKING
|
2021 |
Blondel, M. |
| DEEP COORDINATION GRAPHS
|
2021 |
Bohmer, W. |
| LORENTZ GROUP EQUIVARIANT NEURAL NETWORK FOR PARTICLE PHYSICS
|
2021 |
Bogatskiy, Alexander |
| SPECTRUM DEPENDENT LEARNING CURVES IN KERNEL REGRESSION AND WIDE NEURAL NETWORKS
|
2021 |
Bordelon, Blake |
| TIGHTENING EXPLORATION IN UPPER CONFIDENCE REINFORCEMENT LEARNING
|
2021 |
Bourel, Hippolyte |
| LATENT VARIABLE MODELLING WITH HYPERBOLIC NORMALIZING FLOWS
|
2021 |
Bose, Avishek Joey |
| CALIBRATION, ENTROPY RATES, AND MEMORY IN LANGUAGE MODELS
|
2021 |
Braverman, Mark |
| ADVERSARIAL FILTERS OF DATASET BIASES
|
2021 |
Bras, Ronan Le |
| GNN-FILM: GRAPH NEURAL NETWORKS WITH FEATURE-WISE LINEAR MODULATION
|
2021 |
Brockschmidt, M. |
| TASKNORM: RETHINKING BATCH NORMALIZATION FOR META-LEARNING
|
2021 |
Bronskill, John |
| SAFE IMITATION LEARNING VIA FAST BAYESIAN REWARD INFERENCE FROM PREFERENCES
|
2021 |
Brown, Daniel S. |
| POISSON LEARNING: GRAPH BASED SEMI-SUPERVISED LEARNING AT VERY LOW LABEL RATES
|
2021 |
Calder, Jeff |
| EXPLORE, DISCOVER AND LEARN: UNSUPERVISED DISCOVERY OF STATE-COVERING SKILLS
|
2021 |
Campos, Víctor |
| META-LEARNING WITH STOCHASTIC LINEAR BANDITS
|
2021 |
Cella, L. |
| DATA PREPROCESSING TO MITIGATE BIAS: A MAXIMUM ENTROPY BASED APPROACH
|
2021 |
Celis, L. Elisa |
| CONCISE EXPLANATIONS OF NEURAL NETWORKS USING ADVERSARIAL TRAINING
|
2021 |
Chalasani, P. |
| UNLABELLED DATA IMPROVES BAYESIAN UNCERTAINTY CALIBRATION UNDER COVARIATE SHIFT
|
2021 |
Chan, Alex J. |
| OPTIMIZING FOR THE FUTURE IN NON-STATIONARY MDPS
|
2021 |
Chandak, Y. |
Tag hinzufügen