Skip to content
conftrace_

Papers (including subtopics)

Enabling Silent Telemetry Data Transmission with InvisiFlow NSDI 2025 EnergyCompress: A General Case Base Learning Strategy IJCAI 2025 Enhanced H-Consistency Bounds ALT 2025 Enhanced Adaptive Gradient Algorithms for Nonconvex-PL Minimax Optimization AISTATS 2025 Enhancing Network Failure Mitigation with Performance-Aware Ranking NSDI 2025 Enhancing Parallelism in Decentralized Stochastic Convex Optimization ICML 2025 EnliveningGS: Active Locomotion of 3DGS CVPR 2025 Ensuring Reliable and Transparent Algorithmic Fairness Through Optimal Transport and Uncertainty Quantification IJCAI 2025 Enumerating Optimal Cost-Constrained Adjustment Sets UAI 2025 Epistemic EFX Allocations Exist for Monotone Valuations AAAI 2025 Equal Merit Does Not Imply Equality: Discrimination at Equilibrium in a Hiring Market with Symmetric Agents AAAI 2025 Equilibria of the Colonel Blotto Games with Costs AAAI 2025 Error Analysis Affected by Heavy-Tailed Gradients for Non-Convex Pairwise Stochastic Gradient Descent AAAI 2025 Error bounds for particle gradient descent, and extensions of the log-Sobolev and Talagrand inequalities JMLR 2025 Error dynamics of mini-batch gradient descent with random reshuffling for least squares regression ALT 2025 Escaping Saddle Point Efficiently in Minimax and Bilevel Optimizations IJCAI 2025 Every Bit Helps: Achieving the Optimal Distortion with a Few Queries AAAI 2025 Every Call is Precious: Global Optimization of Black-Box Functions with Unknown Lipschitz Constants AISTATS 2025 Evolutionary Algorithms Are Significantly More Robust to Noise When They Ignore It IJCAI 2025 Evolutionary Classifier Chain for Multi-Dimensional Classification AAAI 2025 Evolutionary Large Language Model for Automated Feature Transformation AAAI 2025 Exact Algorithms and Lower Bounds for Forming Coalitions of Constrained Maximum Size AAAI 2025 Exact Algorithms for Multiagent Path Finding with Communication Constraints on Tree-Like Structures AAAI 2025 Exact Algorithms with New Upper Bounds for the Maximum k-plex Problem IJCAI 2025 Exact discovery is polynomial for certain sparse causal Bayesian networks CLeaR 2025