← Search

Mingze Wang

18 accepted papers

2026

CrossCheck-Bench: Diagnosing Compositional Failures in Multimodal Conflict Resolution

AAAI 2026technical

Multimodal Large Language Models are primarily trained and evaluated on aligned image-text pairs, which leaves their ability to detect and resolve real-world inconsistencies largely unexplored. In open-domain applications visual and textual cues often conflict, requiring models to perform structured

Cited by 0SourcePDFScholar
2026

Fast Catch-Up, Late Switching: Optimal Batch Size Scheduling via Functional Scaling Laws

ICLR 2026poster

Batch size scheduling (BSS) plays a critical role in large-scale deep learning training, influencing both optimization dynamics and computational efficiency. Yet, its theoretical foundations remain poorly understood. In this work, we show that the **functional scaling law (FSL)** framework introduce…

Cited by 0SourceScholar
2026

GradPower: Powering Gradients for Faster Language Model Pre-Training

ICML 2026poster

We propose **GradPower**, a lightweight gradient-transformation technique for accelerating language model pre-training. Given a gradient vector $\boldsymbol{g}=(g\_{i})\_{i}$, GradPower first applies the elementwise `sign-power` transformation: $ \varphi_p(\boldsymbol{g}) = \left({\rm sign}(g\_i)|g\…

Cited by 0SourceScholar
2026

On The Surprising Effectiveness of a Single Global Merging in Decentralized Learning

ICLR 2026oral

Decentralized learning provides a scalable alternative to parameter-server-based training, yet its performance is often hindered by limited peer-to-peer communication. In this paper, we study how communication should be scheduled over time to improve global generalization, including determining whe…

Cited by 0SourceScholar
2026

On the Learning Dynamics of Two-layer Linear Networks with Label Noise SGD

AAAI 2026technical

One crucial factor behind the success of deep learning lies in the implicit bias induced by noise inherent in gradient-based training algorithms. Motivated by empirical observations that training with noisy labels improves model generalization, we delve into the underlying mechanisms behind stochast

Cited by 0SourcePDFScholar
2025

Sharpness-Aware Minimization Efficiently Selects Flatter Minima Late In Training

ICLR 2025spotlight

Sharpness-Aware Minimization (SAM) has substantially improved the generalization of neural networks under various settings. Despite the success, its effectiveness remains poorly understood. In this work, we discover an intriguing phenomenon in the training dynamics of SAM, shedding light on understa…

Cited by 0SourcePDFScholar
2025

The Sharpness Disparity Principle in Transformers for Accelerating Language Model Pre-Training

ICML 2025poster

Transformers have become the cornerstone of modern AI. Unlike traditional architectures, transformers exhibit a distinctive characteristic: diverse types of building blocks, such as embedding layers, normalization layers, self-attention mechanisms, and point-wise feed-forward networks, work collabor…

Cited by 1SourcePDFScholar
2025

Tunable LLM-based Proactive Recommendation Agent

ACL 2025long

Recommender systems are indispensable on various digital platforms. However, traditional methods often reinforce existing user interests, which leads to echo chambers and limits diversity. Proactive Recommendation Systems (PRS) aim to address this issue by cultivating users’ latent interests through…

2024

Are AI-Generated Text Detectors Robust to Adversarial Perturbations?

ACL 2024long

The widespread use of large language models (LLMs) has sparked concerns about the potential misuse of AI-generated text, as these models can produce content that closely resembles human-generated text. Current detectors for AI-generated text (AIGT) lack robustness against adversarial perturbations,…

2024

Improving Generalization and Convergence by Enhancing Implicit Regularization

NeurIPS 2024poster

In this work, we propose an Implicit Regularization Enhancement (IRE) framework to accelerate the discovery of flat solutions in deep learning, thereby improving generalization and convergence. Specifically, IRE decouples the dynamics of flat and sharp directions, which boosts the sharpness reducti…

2024

Learning 1-Bit Tiny Object Detector with Discriminative Feature Refinement

ICML 2024poster

1-bit detectors show impressive performance comparable to their real-valued counterparts when detecting commonly sized objects while exhibiting significant performance degradation on tiny objects. The challenge stems from the fact that high-level features extracted by 1-bit convolutions seem less co…

Cited by 1SourcePDFScholar
2024

Parameter Symmetry and Noise Equilibrium of Stochastic Gradient Descent

NeurIPS 2024poster

Symmetries are prevalent in deep learning and can significantly influence the learning dynamics of neural networks. In this paper, we examine how exponential symmetries -- a broad subclass of continuous symmetries present in the model architecture or loss function -- interplay with stochastic gradie…

Cited by 3SourcePDFScholar
2023

Understanding Multi-phase Optimization Dynamics and Rich Nonlinear Behaviors of ReLU Networks

NeurIPS 2023spotlight

The training process of ReLU neural networks often exhibits complicated nonlinear phenomena. The nonlinearity of models and non-convexity of loss pose significant challenges for theoretical analysis. Therefore, most previous theoretical works on the optimization dynamics of neural networks focus ei…

2022

Early Stage Convergence and Global Convergence of Training Mildly Parameterized Neural Networks

NeurIPS 2022accept

The convergence of GD and SGD when training mildly parameterized neural networks starting from random initialization is studied. For a broad range of models and loss functions, including the widely used square loss and cross entropy loss, we prove an ''early stage convergence'' result. We show that…

2022

The alignment property of SGD noise and how it helps select flat minima: A stability analysis

NeurIPS 2022accept

The phenomenon that stochastic gradient descent (SGD) favors flat minima has played a critical role in understanding the implicit regularization of SGD. In this paper, we provide an explanation of this striking phenomenon by relating the particular noise structure of SGD to its \emph{linear stabi…

Cited by 36SourcePDFScholar