| SPARSE AND CONTINUOUS ATTENTION MECHANISMS
|
2021 |
Martins, André |
| GENERALIZED FOCAL LOSS: LEARNING QUALIFIED AND DISTRIBUTED BOUNDING BOXES FOR DENSE OBJECT DETECTION
|
2021 |
Li, Xiang |
| SELF-TRAINING AVOIDS USING SPURIOUS FEATURES UNDER DOMAIN SHIFT
|
2021 |
Chen, Yining |
| REGRET IN ONLINE RECOMMENDATION SYSTEMS
|
2021 |
Ariu, Kaito |
| QUANTIFYING THE EMPIRICAL WASSERSTEIN DISTANCE TO A SET OF MEASURES: BEATING THE CURSE OF DIMENSIONALITY
|
2021 |
Si, Nian |
| BOOTSTRAP YOUR OWN LATENT - A NEW APPROACH TO SELF-SUPERVISED LEARNING
|
2021 |
Grill, Jean-Bastien |
| EFFICIENT CLUSTERING FOR STRETCHED MIXTURES: LANDSCAPE AND OPTIMALITY
|
2021 |
Wang, Kaizheng |
| THE STATISTICAL COST OF ROBUST KERNEL HYPERPARAMETER TURNING
|
2021 |
Meyer, Raphael |
| A TOPOLOGICAL FILTER FOR LEARNING WITH LABEL NOISE
|
2021 |
Wu, Pengxiang |
| A NOVEL VARIATIONAL FORM OF THE SCHATTEN-P QUASI-NORM
|
2021 |
Giampouras, Paris |
| BOTORCH: A FRAMEWORK FOR EFFICIENT MONTE-CARLO BAYESIAN OPTIMIZATION
|
2021 |
Balandat, Maximilian |
| ROBUST FEDERATED LEARNING: THE CASE OF AFFINE DISTRIBUTION SHIFTS
|
2021 |
Reisizadeh, Amirhossein |
| GENERATING ADJACENCY-CONSTRAINED SUBGOALS IN HIERARCHICAL REINFORCEMENT LEARNING
|
2021 |
Zhang, Tianren |
| NOT ALL UNLABELED DATA ARE EQUAL: LEARNING TO WEIGHT DATA IN SEMISUPERVISED LEARNING
|
2021 |
Ren, Zhongzheng |
| HARD NEGATIVE MIXING FOR CONTRASTIVE LEARNING
|
2021 |
Kalantidis, Yannis |
| MATRIX COMPLETION WITH QUANTIFIED UNCERTAINTY THROUGH LOW RANK GAUSSIAN COPULA
|
2021 |
Zhao, Yuxuan |
| LEARNING BY MINIMIZING THE SUM OF RANKED RANGE
|
2021 |
Hu, Shu |
| ESCAPING THE GRAVITATIONAL PULL OF SOFTMAX
|
2021 |
Mei, Jincheng |
| POMO: POLICY OPTIMIZATION WITH MULTIPLE OPTIMA FOR REINFORCEMENT LEARNING
|
2021 |
Kwon, Yeong-Dae |
| LEARNING TO LEARN WITH FEEDBACK AND LOCAL PLASTICITY
|
2021 |
Lindsey, Jack |
Tag hinzufügen