Skip to content
conftrace_

Papers (including subtopics)

Rethinking the Variational Interpretation of Accelerated Optimization Methods NeurIPS 2021 Rethinking Transformer-Based Set Prediction for Object Detection ICCV 2021 Rethink the Connections among Generalization, Memorization, and the Spectral Bias of DNNs IJCAI 2021 Retrieve and Revise: Improving Peptide Identification with Similar Mass Spectra AAAI 2021 RETRIEVE: Coreset Selection for Efficient and Robust Semi-Supervised Learning NeurIPS 2021 Revealing and Protecting Labels in Distributed Training NeurIPS 2021 Revealing the Structure of Deep Neural Networks via Convex Duality ICML 2021 Revenue maximization via machine learning with noisy data NeurIPS 2021 Reverse engineering learned optimizers reveals known and novel mechanisms NeurIPS 2021 Revisiting Co-Occurring Directions: Sharper Analysis and Efficient Algorithm for Sparse Matrices AAAI 2021 Revisiting Dynamic Convolution via Matrix Decomposition ICLR 2021 Revisiting Hilbert-Schmidt Information Bottleneck for Adversarial Robustness NeurIPS 2021 Revisiting Locally Supervised Learning: an Alternative to End-to-end Training ICLR 2021 Revisiting Model-Agnostic Private Learning: Faster Rates and Active Learning JMLR 2021 Revisiting Model Stitching to Compare Neural Representations NeurIPS 2021 Revisiting Parity of Human vs. Machine Conversational Speech Transcription Interspeech 2021 Revisiting Projection-free Online Learning: the Strongly Convex Case AISTATS 2021 Revisiting ResNets: Improved Training and Scaling Strategies NeurIPS 2021 Revisiting Smoothed Online Learning NeurIPS 2021 Revisiting the Calibration of Modern Neural Networks NeurIPS 2021 Revisiting the Role of Euler Numerical Integration on Acceleration and Stability in Convex Optimization AISTATS 2021 Revisiting Wedge Sampling for Budgeted Maximum Inner Product Search (Extended Abstract) IJCAI 2021 Revisiting Weight Initialization of Deep Neural Networks ACML 2021 Reward-Biased Maximum Likelihood Estimation for Linear Stochastic Bandits AAAI 2021 Reward Biased Maximum Likelihood Estimation for Reinforcement Learning L4DC 2021