← Search

Zhanxing Zhu

40 accepted papers

2026

Learning Dynamics of Logits Debiasing for Long-Tailed Semi-Supervised Learning

ICLR 2026poster

Long-tailed distributions are prevalent in real-world semi-supervised learning (SSL), where pseudo-labels tend to favor majority classes, leading to degraded generalization. Although numerous long-tailed SSL (LTSSL) methods have been proposed, the underlying mechanisms of class bias remain underexpl…

Cited by 0SourceScholar
2026

MAVEN: A Mesh-Aware Volumetric Encoding Network for Simulating 3D Flexible Deformation

ICLR 2026poster

Deep learning-based approaches, particularly graph neural networks (GNNs), have gained prominence in simulating flexible deformations and contacts of solids, due to their ability to handle unstructured physical fields and nonlinear regression on graph structures. However, existing GNNs commonly repr…

Cited by 0SourcecodeScholar
2026

MoDr: Mixture-of-Depth-Recurrent Transformers for Test-Time Reasoning

ICLR 2026poster

Large Language Models have demonstrated superior reasoning capabilities by generating step-by-step reasoning in natural language before deriving the final answer. Recently, Geiping et al. introduced 3.5B-Huginn as an alternative to this paradigm, a depth-recurrent Transformer that increases computat…

Cited by 0SourceScholar
2026

Modelling Attention with Aitchison Geometry: Token Distinguishability and Temperature Scaling

ICML 2026poster

The attention mechanism with softmax normalisation is a foundational component of Transformer-based large language models. However, with very long contexts, attention scores are known to diminish, raising fundamental questions about token distinguishability and how it can be preserved. In this work,…

Cited by 0SourceScholar
2026

Neural Latent Arbitrary Lagrangian-Eulerian Grids for Fluid-Solid Interaction

ICLR 2026poster

Fluid-solid interaction (FSI) problems are fundamental in many scientific and engineering applications, yet effectively capturing the highly nonlinear two-way interactions remains a significant challenge. Most existing deep learning methods are limited to simplified one-way FSI scenarios, often assu…

Cited by 0SourcecodeScholar
2026

SlaClip: Gradient Norm Slacks can be Indicator for Adaptive Clipping in DP-SGD

ICML 2026spotlight

Differentially private stochastic gradient descent (DP-SGD) achieves privacy by clipping per-sample gradients and injecting Gaussian noise, but its utility is highly sensitive to the choice of the clipping threshold $C$. A fixed $C$ often degrades performance and necessitates repeated empirical cali…

Cited by 0SourceScholar
2026

Transformers with RL or SFT Provably Learn Sparse Boolean Functions, But Differently

ICML 2026poster

Transformers can acquire Chain-of-Thought (CoT) capabilities to solve complex reasoning tasks through fine-tuning. Reinforcement learning (RL) and supervised fine-tuning (SFT) are two primary approaches to this end. In this work, we examine them specifically for learning k-sparse Boolean functions w…

Cited by 0SourceScholar
2026

ViTE: Virtual Graph Trajectory Expert Router for Pedestrian Trajectory Prediction

AAAI 2026technical

Pedestrian trajectory prediction is critical for ensuring safety in autonomous driving, surveillance systems, and urban planning applications. While early approaches primarily focus on one-hop pairwise relationships, recent studies attempt to capture high-order interactions by stacking multiple Grap

Cited by 0SourcePDFScholar
2025

Effects of Momentum in Implicit Bias of Gradient Flow for Diagonal Linear Networks

AAAI 2025technical

This paper targets on the regularization effect of momentum-based methods in regression settings and analyzes the popular diagonal linear networks to precisely characterize the implicit bias of continuous versions of heavy-ball (HB) and Nesterov's method of accelerated gradients (NAG). We show that,…

Cited by 0SourcePDFScholar
2025

Heavy-Ball Momentum Method in Continuous Time and Discretization Error Analysis

NeurIPS 2025poster

This paper establishes a continuous time approximation, a piece-wise continuous differential equation, for the discrete Heavy-Ball (HB) momentum method with explicit discretization error. Investigating continuous differential equations has been a promising approach for studying the discrete optimiza…

Cited by 0SourceScholar
2025

Unisoma: A Unified Transformer-based Solver for Multi-Solid Systems

ICML 2025poster

Multi-solid systems are foundational to a wide range of real-world applications, yet modeling their complex interactions remains challenging. Existing deep learning methods predominantly rely on implicit modeling, where the factors influencing solid deformation are not explicitly represented but are…

2024

Memory-Efficient Gradient Unrolling for Large-Scale Bi-level Optimization

NeurIPS 2024poster

Bi-level optimizaiton (BO) has become a fundamental mathematical framework for addressing hierarchical machine learning problems. As deep learning models continue to grow in size, the demand for scalable bi-level optimization has become increasingly critical. Traditional gradient-based bi-level opti…

2023

MonoFlow: Rethinking Divergence GANs via the Perspective of Wasserstein Gradient Flows

ICML 2023poster

The conventional understanding of adversarial training in generative adversarial networks (GANs) is that the discriminator is trained to estimate a divergence, and the generator learns to minimize this divergence. We argue that despite the fact that many variants of GANs were developed following thi…

Cited by 16SourcePDFScholar
2022

Fine-grained Differentiable Physics: A Yarn-level Model for Fabrics

ICLR 2022poster

Differentiable physics modeling combines physics models with gradient-based learning to provide model explicability and data efficiency. It has been used to learn dynamics, solve inverse problems and facilitate design, and is at its inception of impact. Current successes have concentrated on general…

2021

Amata: An Annealing Mechanism for Adversarial Training Acceleration

AAAI 2021technical

Despite the empirical success in various domains, it has been revealed that deep neural networks are vulnerable to maliciously perturbed input data that much degrade their performance. This is known as adversarial attacks. To counter adversarial attacks, adversarial training formulated as a form of…

2021

Neural Approximate Sufficient Statistics for Implicit Models

ICLR 2021spotlight

We consider the fundamental problem of how to automatically construct summary statistics for implicit generative models where the evaluation of the likelihood function is intractable but sampling data from the model is possible. The idea is to frame the task of constructing sufficient statistics as…

Cited by 78SourcePDFScholar
2021

Positive-Negative Momentum: Manipulating Stochastic Gradient Noise to Improve Generalization

ICML 2021spotlight

It is well-known that stochastic gradient noise (SGN) acts as implicit regularization for deep learning and is essentially important for both optimization and generalization of deep networks. Some works attempted to artificially simulate SGN by injecting random noise to improve deep learning. Howeve…

2021

Spatial-Temporal Fusion Graph Neural Networks for Traffic Flow Forecasting

AAAI 2021technical

Spatial-temporal data forecasting of traffic flow is a challenging task because of complicated spatial dependencies and dynamical trends of temporal pattern between different roads. Existing frameworks usually utilize given spatial adjacency graph and sophisticated mechanisms for modeling spatial an…

2021

Spherical Motion Dynamics: Learning Dynamics of Normalized Neural Network using SGD and Weight Decay

NeurIPS 2021spotlight

In this paper, we comprehensively reveal the learning dynamics of normalized neural network using Stochastic Gradient Descent (with momentum) and Weight Decay (WD), named as Spherical Motion Dynamics (SMD). Most related works focus on studying behavior of ``effective learning rate" in ``equilibrium"…

Cited by 31SourcePDFScholar
2020

Black-Box Certification with Randomized Smoothing: A Functional Optimization Based Framework

NeurIPS 2020poster

Randomized classifiers have been shown to provide a promising approach for achieving certified robustness against adversarial attacks in deep learning. However, most existing methods only leverage Gaussian smoothing noise and only work for $\ell_2$ perturbation. We propose a general framework of adv…

2020

Informative Dropout for Robust Representation Learning: A Shape-bias Perspective

ICML 2020poster

Convolutional Neural Networks (CNNs) are known to rely more on local texture rather than global shape when making decisions. Recent work also indicates a close relationship between CNN’s texture-bias and its robustness against distribution shift, adversarial perturbation, random corruption, etc. In…

2020

Knowledge Distillation in Wide Neural Networks: Risk Bound, Data Efficiency and Imperfect Teacher

NeurIPS 2020poster

Knowledge distillation is a strategy of training a student network with guide of the soft output from a teacher network. It has been a successful method of model compression and knowledge transfer. However, currently knowledge distillation lacks a convincing theoretical understanding. On the other h…

Cited by 52SourcePDFScholar
2020

On the Noisy Gradient Descent that Generalizes as SGD

ICML 2020poster

The gradient noise of SGD is considered to play a central role in the observed strong generalization abilities of deep learning. While past studies confirm that the magnitude and the covariance structure of gradient noise are critical for regularization, it remains unclear whether or not the class o…

2019

The Anisotropic Noise in Stochastic Gradient Descent: Its Behavior of Escaping from Sharp Minima and Regularization Effects

ICML 2019oral

Understanding the behavior of stochastic gradient descent (SGD) in the context of deep neural networks has raised lots of concerns recently. Along this line, we study a general form of gradient based optimization dynamics with unbiased noise, which unifies SGD and standard Langevin dynamics. Through…

2019

You Only Propagate Once: Accelerating Adversarial Training via Maximal Principle

NeurIPS 2019poster

Deep learning achieves state-of-the-art results in many tasks in computer vision and natural language processing. However, recent works have shown that deep networks can be vulnerable to adversarial perturbations which raised a serious robustness issue of deep networks. Adversarial training, typical…

2018

Reinforced Continual Learning

NeurIPS 2018poster

Most artificial intelligence models are limited in their ability to solve new tasks faster, without forgetting previously acquired knowledge. The recently emerging paradigm of continual learning aims to solve this issue, in which the model learns various tasks in a sequential fashion. In this work,…

Cited by 469SourcePDFScholar
2018

Thermostat-assisted continuously-tempered Hamiltonian Monte Carlo for Bayesian learning

NeurIPS 2018poster

In this paper, we propose a novel sampling method, the thermostat-assisted continuously-tempered Hamiltonian Monte Carlo, for the purpose of multimodal Bayesian learning. It simulates a noisy dynamical system by incorporating both a continuously-varying tempering variable and the Nos\'e-Hoover therm…

2017

Langevin Dynamics with Continuous Tempering for Training Deep Neural Networks

NeurIPS 2017poster

Minimizing non-convex and high-dimensional objective functions is challenging, especially when training modern deep neural networks. In this paper, a novel approach is proposed which divides the training process into two consecutive phases to obtain better generalization performance: Bayesian sampl…

Cited by 27SourcePDFScholar
2015

Covariance-Controlled Adaptive Langevin Thermostat for Large-Scale Bayesian Sampling

NeurIPS 2015poster

Monte Carlo sampling for Bayesian posterior inference is a common approach used in machine learning. The Markov Chain Monte Carlo procedures that are used are often discrete-time analogues of associated stochastic differential equations (SDEs). These SDEs are guaranteed to leave invariant the requir…

Cited by 58SourcePDFScholar