Skip to content
conftrace_

Papers (including subtopics)

Efficient methods for Gaussian Markov random fields under sparse linear constraints NeurIPS 2021 Efficient Mirror Descent Ascent Methods for Nonsmooth Minimax Problems NeurIPS 2021 Efficient online inference for nonparametric mixture models UAI 2021 Efficient Online Learning for Dynamic k-Clustering ICML 2021 Efficient Optimal Selection for Composited Advertising Creatives with Tree Structure AAAI 2021 Efficient Pure Exploration for Combinatorial Bandits with Semi-Bandit Feedback ALT 2021 Efficient Real-Time Radial Distortion Correction for UAVs WACV 2021 Efficient Truncated Linear Regression with Unknown Noise Variance NeurIPS 2021 Efficient Truthful Scheduling and Resource Allocation through Monitoring AAAI 2021 Elastic Consistency: A Practical Consistency Model for Distributed Stochastic Gradient Descent AAAI 2021 ELLIPSDF: Joint Object Pose and Shape Optimization With a Bi-Level Ellipsoid and Signed Distance Function Description ICCV 2021 Emergent Prosociality in Multi-Agent Games Through Gifting IJCAI 2021 Emerging Methods of Auction Design in Social Networks IJCAI 2021 Enabling long-range exploration in minimization of multimodal functions UAI 2021 End-to-End Constrained Optimization Learning: A Survey IJCAI 2021 Enhance Curvature Information by Structured Stochastic Quasi-Newton Methods CVPR 2021 Enhancing Balanced Graph Edge Partition with Effective Local Search AAAI 2021 Enhancing Parameter-Free Frank Wolfe with an Extra Subproblem AAAI 2021 Enhancing Robustness of Neural Networks through Fourier Stabilization ICML 2021 Ensembling Graph Predictions for AMR Parsing NeurIPS 2021 Entropy Partial Transport with Tree Metrics: Theory and Practice AISTATS 2021 Epsilon Best Arm Identification in Spectral Bandits IJCAI 2021 Equitable and Optimal Transport with Multiple Agents AISTATS 2021 Equitable Scheduling on a Single Machine AAAI 2021 ErrorCompensatedX: error compensation for variance reduced algorithms NeurIPS 2021