Skip to content
conftrace_

Papers (including subtopics)

Optimizing $(L_0, L_1)$-Smooth Functions by Gradient Methods ICLR 2025 Optimizing for the Shortest Path in Denoising Diffusion Model CVPR 2025 Optimizing Label Assignment for Weakly Supervised Person Search AAAI 2025 Optimizing Noise Distributions for Differential Privacy ICML 2025 Optimizing Parameters of Quantum Circuits with Sparsity-Inducing Coordinate Descent IJCAI 2025 Optimizing Posterior Samples for Bayesian Optimization via Rootfinding ICLR 2025 Optimizing Social Network Interventions via Hypergradient-Based Recommender System Design ICML 2025 Optimizing Vital Sign Monitoring in Resource-Constrained Maternal Care: An RL-Based Restless Bandit Approach AAAI 2025 Opt-Out: Investigating Entity-Level Unlearning for Large Language Models via Optimal Transport ACL 2025 ORMind: A Cognitive-Inspired End-to-End Reasoning Framework for Operations Research ACL 2025 OT-DETECTOR: Delving into Optimal Transport for Zero-shot Out-of-Distribution Detection IJCAI 2025 Out-of-distribution Robust Optimization UAI 2025 Overtuning in Hyperparameter Optimization AutoML 2025 PA3Fed: Period-Aware Adaptive Aggregation for Improved Federated Learning AAAI 2025 PAC-Bayes Analysis for Recalibration in Classification ICML 2025 PAC Learning with Improvements ICML 2025 Paid with Models: Optimal Contract Design for Collaborative Machine Learning AAAI 2025 Pairwise Maximum Likelihood For Multi-Class Logistic Regression Model With Multiple Rare Classes ICML 2025 Parabolic Continual Learning AISTATS 2025 Parallel Greedy Best-First Search with a Bound on Expansions Relative to Sequential Search AAAI 2025 Parameterized Approximation Algorithm for Doubly Constrained Fair Clustering IJCAI 2025 Pareto-frontier Entropy Search with Variational Lower Bound Maximization ICML 2025 Pareto Merging: Multi-Objective Optimization for Preference-Aware Model Merging ICML 2025 Pareto-Optimal Fronts for Benchmarking Symbolic Regression Algorithms ICML 2025 Pareto-Optimality, Smoothness, and Stochasticity in Learning-Augmented One-Max-Search ICML 2025