Skip to content
conftrace_

Papers (including subtopics)

Smooth p-Wasserstein Distance: Structure, Empirical Approximation, and Statistical Applications ICML 2021 Smooth Bandit Optimization: Generalization to Holder Space AISTATS 2021 Smooth Convex Optimization Using Sub-Zeroth-Order Oracles AAAI 2021 Smoothing and Shrinking the Sparse Seq2Seq Search Space NAACL 2021 SmoothMix: Training Confidence-calibrated Smoothed Classifiers for Certified Robustness NeurIPS 2021 Smoothness Matrices Beat Smoothness Constants: Better Communication Compression Techniques for Distributed Optimization NeurIPS 2021 Smooth Normalizing Flows NeurIPS 2021 SNIPS: Solving Noisy Inverse Problems Stochastically NeurIPS 2021 Soft Calibration Objectives for Neural Networks NeurIPS 2021 Softmax Policy Gradient Methods Can Take Exponential Time to Converge COLT 2021 Soft Tensor Regression JMLR 2021 Solving high-dimensional parabolic PDEs using the tensor train format ICML 2021 Solving Min-Max Optimization with Hidden Structure via Gradient Descent Ascent NeurIPS 2021 Some Theoretical Insights into Wasserstein GANs JMLR 2021 SONIA: A Symmetric Blockwise Truncated Optimization Algorithm AISTATS 2021 SOPE: Spectrum of Off-Policy Estimators NeurIPS 2021 Sound Source Localization with Majorization Minimization Interspeech 2021 Source Identification for Mixtures of Product Distributions COLT 2021 SPADE: A Semi-supervised Probabilistic Approach for Detecting Errors in Tables IJCAI 2021 SPADE: A Spectral Method for Black-Box Adversarial Robustness Evaluation ICML 2021 Sparse Algorithms for Markovian Gaussian Processes AISTATS 2021 Sparse and Imperceptible Adversarial Attack via a Homotopy Algorithm ICML 2021 Sparse Bayesian Learning via Stepwise Regression ICML 2021 Sparse Convex Optimization via Adaptively Regularized Hard Thresholding JMLR 2021 Sparse Deep Learning: A New Framework Immune to Local Traps and Miscalibration NeurIPS 2021