| EXPLAINABLE K-MEANS AND K-MEDIANS CLUSTERING
|
2021 |
Dasgupta, Sanjoy |
| TWO SIMPLE WAYS TO LEARN INDIVIDUAL FAIRNESS METRICS FROM DATA
|
2021 |
Mukherjee, Debarghya |
| MISSING DATA IMPUTATION USING OPTIMAL TRANSPORT
|
2021 |
Muzellec, Boris |
| POLYGEN: AN AUTOREGRESSIVE GENERATIVE MODEL OF 3D MESHES
|
2021 |
Nash, C. |
| UP OR DOWN? ADAPTIVE ROUNDING FOR POST-TRAINING QUANTIZATION
|
2021 |
Nagel, Markus |
| ORACLE EFFICIENT PRIVATE NON-CONVEX OPTIMIZATION
|
2021 |
Neel, Seth |
| BAYESIAN SPARSIFICATION OF DEEP C-VALUED NETWORKS
|
2021 |
Nazarov, Ivan |
| INVOLUTIVE MCMC: A UNIFYING FRAMEWORK
|
2021 |
Neklyudov, K. |
| LEEP: A NEW MEASURE TO EVALUATE TRANSFERABILITY OF LEARNED REPRESENTATIONS
|
2021 |
Nguyen, Cuong V. |
| SEMI-SUPERVISED STYLEGAN FOR DISENTANGLEMENT LEARNING
|
2021 |
Nie, Weili |
| CONSISTENT STRUCTURED PREDICTION WITH MAX-MIN MARGIN MARKOV NETWORKS
|
2021 |
Nowak-Vila, A. |
| ON THE (IN)TRACTABILITY OF COMPUTING NORMALIZING CONSTANTS FOR THE PRODUCT OF DETERMINANTAL POINT PROCESSES
|
2021 |
Ohsaka, N. |
| LEARNING SELECTION STRATEGIES IN BUCHBERGER'S ALGORITHM
|
2021 |
Peifer, Dylan |
| SAMPLE FACTORY: EGOCENTRIC 3D CONTROL FROM PIXELS AT 100000 FPS WITH ASYNCHRONOUS REINFORCEMENT LEARNING
|
2021 |
Petrenko, Aleksei |
| SCALABLE DIFFERENTIAL PRIVACY WITH CERTIFIED ROBUSTNESS IN ADVERSARIAL LEARNING
|
2021 |
Phan, NhatHai |
| ON UNBALANCED OPTIMAL TRANSPORT: AN ANALYSIS OF SINKHORN ALGORITHM
|
2021 |
Pham, Khiem |
| UPBOOST —- NON-CONVEX BOOSTING VIA INTEGER PROGRAMMING
|
2021 |
Pfetsch, Marc |
| DISSECTING NON-VACUOUS GENERALIZATION BOUNDS BASED ON THE MEAN-FIELD APPROXIMATION
|
2021 |
Pitas, Konstantinos |
| EFFICIENT DOMAIN GENERALIZATION VIA COMMON-SPECIFIC LOW-RANK DECOMPOSITION
|
2021 |
Piratla, Vihari |
| ADVERSARIAL RISK VIA OPTIMAL TRANSPORT AND OPTIMAL COUPLINGS
|
2021 |
Pydi, Muni Sreenivas |
Tag hinzufügen