| BENCHMARKING DEEP INVERSE MODELS OVER TIME, AND THE NEURAL-ADJOINT METHOD
|
2021 |
Ren, Simiao |
| DEEP RECONSTRUCTION OF STRANGE ATTRACTORS FROM TIME SERIES
|
2021 |
Gilpin, William |
| HARD SHAPE-CONSTRAINED KERNEL MACHINES
|
2021 |
Aubin-Frankowski, Pierre-Cyril |
| ON THE VALUE OF OUT-OF-DISTRIBUTION TESTING: AN EXAMPLE OF GOODHART'S LAW
|
2021 |
Teney, Damien |
| LEARNING MANIFOLD IMPLICITLY VIA EXPLICIT HEAT-KERNEL LEARNING
|
2021 |
Zhou, Yufan |
| SUBMODULAR MAXIMIZATION THROUGH BARRIER FUNCTIONS
|
2021 |
Badanidiyuru, Ashwinkumar |
| RANKMAX: AN ADAPTIVE PROJECTION ALTERNATIVE TO THE SOFTMAX FUNCTION
|
2021 |
Kong, Weiwei |
| A GRAPH SIMILARITY FOR DEEP LEARNING
|
2021 |
Ok, Seongmin |
| NEURAL METHODS FOR POINT-WISE DEPENDENCY ESTIMATION
|
2021 |
Tsai, Yao-Hung Hubert |
| BACKPROPAGATING LINEARLY IMPROVES TRANSFERABILITY OF ADVERSARIAL EXAMPLES
|
2021 |
Guo, Yiwen |
| FOURIER SPARSE LEVERAGE SCORES AND APPROXIMATE KERNEL LEARNING
|
2021 |
Erdelyi, Tamas |
| IMPROVED ALGORITHMS FOR ONLINE SUBMODULAR MAXIMIZATION VIA FIRST-ORDER REGRET BOUNDS
|
2021 |
Harvey, Nicholas |
| TRADING PERSONALIZATION FOR ACCURACY: DATA DEBUGGING IN COLLABORATIVE FILTERING
|
2021 |
Chen, Long |
| RECIPROCAL ADVERSARIAL LEARNING VIA CHARACTERISTIC FUNCTIONS
|
2021 |
Li, Shengxi |
| IMPROVING LOCAL IDENTIFIABILITY IN PROBABILISTIC BOX EMBEDDINGS
|
2021 |
Dasgupta, Shib |
| THE STATISTICAL COMPLEXITY OF EARLY-STOPPED MIRROR DESCENT
|
2021 |
Vaskevicius, Tomas |
| A CAUSAL VIEW ON ROBUSTNESS OF NEURAL NETWORKS
|
2021 |
Zhang, Cheng |
| MINIMAX CLASSIFICATION WITH 0-1 LOSS AND PERFORMANCE GUARANTEES
|
2021 |
Mazuelas, Santiago |
| HOW TO LEARN A USEFUL CRITIC? MODEL-BASED ACTION-GRADIENT-ESTIMATOR POLICY OPTIMIZATION
|
2021 |
D'Oro, Pierluca |
| EFFICIENT CONTEXTUAL BANDITS WITH CONTINUOUS ACTIONS
|
2021 |
Majzoubi, Maryam |
Tag hinzufügen