← Search

Lixing Chen

9 accepted papers

2025

Can LLMs Correct Themselves? A Benchmark of Self-Correction in LLMs

NeurIPS 2025poster

Self-correction of large language models (LLMs) emerges as a critical component for enhancing their reasoning performance. Although various self-correction methods have been proposed, a comprehensive evaluation of these methods remains largely unexplored, and the question of whether LLMs can truly c…

Cited by 0SourceScholar
2025

How Does the Smoothness Approximation Method Facilitate Generalization for Federated Adversarial Learning?

AAAI 2025technical

Federated Adversarial Learning (FAL) is a robust framework for resisting adversarial attacks on federated learning. Although some FAL studies have developed efficient algorithms, they primarily focus on convergence performance and overlook generalization. Generalization is crucial for evaluating alg…

Cited by 0SourcePDFScholar
2025

On the Stability and Generalization of Meta-Learning: the Impact of Inner-Levels

NeurIPS 2025poster

Meta-learning has achieved significant advancements, with generalization emerging as a key metric for evaluating meta-learning algorithms. While recent studies have mainly focused on training strategies, data-split methods, and tightening generalization bounds, they often ignore the impact of inner-…

Cited by 0SourceScholar
2025

Stability and Generalization for Stochastic (Compositional) Optimizations

IJCAI 2025

The use of estimators instead of stochastic gradients for updates has been shown to improve algorithm convergence rates of, but their impact on generalization remains under-explored. In this paper, we investigate how estimators influence generalization. Our focus is on two widely studied problems: s

Cited by 0SourcePDFScholar
2024

Hiding Imperceptible Noise in Curvature-Aware Patches for 3D Point Cloud Attack

ECCV 2024poster

"With the maturity of depth sensors, point clouds have received increasing attention in various 3D safety-critical applications, while deep point cloud learning models have been shown to be vulnerable to adversarial attacks. Most existing 3D attackers rely on implicit global distance losses to pertu…

Cited by 6SourcePDFScholar
2024

Stability and Generalization for Stochastic Recursive Momentum-based Algorithms for (Strongly-)Convex One to $K$-Level Stochastic Optimizations

ICML 2024poster

STOchastic Recursive Momentum (STORM)-based algorithms have been widely developed to solve one to $K$-level ($K \geq 3$) stochastic optimization problems. Specifically, they use estimators to mitigate the biased gradient issue and achieve near-optimal convergence results. However, there is relativel…

Cited by 0SourcePDFScholar
2024

What Makes Good Collaborative Views? Contrastive Mutual Information Maximization for Multi-Agent Perception

AAAI 2024technical

Multi-agent perception (MAP) allows autonomous systems to understand complex environments by interpreting data from multiple sources. This paper investigates intermediate collaboration for MAP with a specific focus on exploring "good" properties of collaborative view (i.e., post-collaboration featur…

2023

How To Prevent the Poor Performance Clients for Personalized Federated Learning?

CVPR 2023poster

Personalized federated learning (pFL) collaboratively trains personalized models, which provides a customized model solution for individual clients in the presence of heterogeneous distributed local data. Although many recent studies have applied various algorithms to enhance personalization in pFL,…

Cited by 19SourcePDFScholar
2018

Contextual Combinatorial Multi-armed Bandits with Volatile Arms and Submodular Reward

NeurIPS 2018poster

In this paper, we study the stochastic contextual combinatorial multi-armed bandit (CC-MAB) framework that is tailored for volatile arms and submodular reward functions. CC-MAB inherits properties from both contextual bandit and combinatorial bandit: it aims to select a set of arms in each round bas…

Cited by 86SourcePDFScholar