← Search

Ruizhong Qiu

20 accepted papers

2026

AvAtar: Learning to Align via Active Optimal Transport

ICML 2026poster

Alignment plays a fundamental role in many machine learning problems, such as multi-network analysis, multimodal learning, and point cloud registration. Recent works increasingly leverage optimal transport (OT) for distributional alignment, whose effectiveness largely depends on sparse supervision t…

Cited by 0SourceScholar
2026

Beyond Log Likelihood: Probability-Based Objectives for Supervised Fine-Tuning across the Model Capability Continuum

ICML 2026spotlight

Supervised fine-tuning (SFT) is the standard approach for post-training large language models (LLMs), yet it often shows limited generalization. We trace this limitation to its default training objective: negative log likelihood (NLL). While NLL is classically optimal when training from scratch, pos…

Cited by 0SourceScholar
2026

DAG-MoE: From Simple Mixture to Structural Aggregation in Mixture-of-Experts

ICML 2026poster

Mixture-of-Experts (MoE) models have become a leading approach for decoupling parameter count from computational cost in large language models. Despite significant progress, effectively scaling MoE performance remains a challenge. Previous work shows that the use of fine-grained experts enlarges the…

Cited by 0SourceScholar
2026

Graph homophily booster: Reimagining the role of discrete features in heterophilic graph learning

ICLR 2026poster

Graph neural networks (GNNs) have emerged as a powerful tool for modeling graph-structured data, demonstrating remarkable success in many real-world applications such as complex biological network analysis, neuroscientific analysis, and social network analysis. However, existing GNNs often struggle…

Cited by 0SourcecodeScholar
2026

Influence-Preserving Proxies for Gradient-Based Data Selection in LLM FineTuning

ICLR 2026poster

Supervised fine-tuning (SFT) relies critically on selecting training data that most benefits model's downstream performance. Gradient-based data selection methods such as TracIn and Influence Functions leverage influence to identify useful samples, but their computational cost scales poorly, making…

Cited by 0SourcecodeScholar
2026

Latent Collaboration in Multi-Agent Systems

ICML 2026spotlight

Multi-agent systems (MAS) extend large language models (LLMs) from independent single-model reasoning to coordinative system-level intelligence. While existing LLM agents depend on text-based mediation for reasoning and communication, we take a step forward by enabling models to collaborate directly…

Cited by 0SourceScholar
2026

MORALISE: A Structured Benchmark for Moral Alignment in Visual Language Models

ICML 2026poster

Recently, vision-language models have demonstrated increasing influence in morally sensitive domains such as autonomous driving and medical analysis, owing to their powerful multimodal reasoning capabilities. As these models are deployed in high-stakes real-world applications, it is of paramount imp…

Cited by 0SourceScholar
2026

PLANETALIGN: A Comprehensive Python Library for Benchmarking Network Alignment

ICLR 2026poster

Network alignment (NA) aims to identify node correspondence across different networks and serves as a critical cornerstone behind various downstream multi-network learning tasks. Despite growing research in NA, there lacks a comprehensive library that facilitates the systematic development and bench…

Cited by 0SourcecodeScholar
2025

Ask, and it shall be given: On the Turing completeness of prompting

ICLR 2025poster

Since the success of GPT, large language models (LLMs) have revolutionized machine learning and have initiated the so-called *LLM prompting* paradigm. In the era of LLMs, people train a single general-purpose LLM and provide the LLM with different *prompts* to perform different tasks. However, such…

2025

Breaking Silos: Adaptive Model Fusion Unlocks Better Time Series Forecasting

ICML 2025poster

Time-series forecasting plays a critical role in many real-world applications. Although increasingly powerful models have been developed and achieved superior results on benchmark datasets, through a fine-grained sample-level inspection, we find that (i) no single model consistently outperforms othe…

2025

How efficient is LLM-generated code? A rigorous & high-standard benchmark

ICLR 2025poster

The emergence of large language models (LLMs) has significantly pushed the frontiers of program synthesis. Advancement of LLM-based program synthesis calls for a thorough evaluation of LLM-generated code. Most evaluation frameworks focus on the (functional) correctness of generated code; efficiency,…

2025

Latte: Collaborative Test-Time Adaptation of Vision-Language Models in Federated Learning

ICCV 2025poster

Test-time adaptation with pre-trained vision-language models has gained increasing attention for addressing distribution shifts during testing. Among these approaches, memory-based algorithms stand out due to their training-free nature and ability to leverage historical test data. However, existing…

2025

Transformer Copilot: Learning from The Mistake Log in LLM Fine-tuning

NeurIPS 2025spotlight

Large language models are typically adapted to downstream tasks through supervised fine-tuning on domain-specific data. While standard fine-tuning focuses on minimizing generation loss to optimize model parameters, we take a deeper step by retaining and leveraging the model’s own learning signals, a…

Cited by 0SourcecodeScholar
2024

BackTime: Backdoor Attacks on Multivariate Time Series Forecasting

NeurIPS 2024spotlight

Multivariate Time Series (MTS) forecasting is a fundamental task with numerous real-world applications, such as transportation, climate, and epidemiology. While a myriad of powerful deep learning models have been developed for this task, few works have explored the robustness of MTS forecasting mode…

2024

Class-Imbalanced Graph Learning without Class Rebalancing

ICML 2024poster

Class imbalance is prevalent in real-world node classification tasks and poses great challenges for graph learning models. Most existing studies are rooted in a class-rebalancing (CR) perspective and address class imbalance with class-wise reweighting or resampling. In this work, we approach the roo…

2024

Discrete-state Continuous-time Diffusion for Graph Generation

NeurIPS 2024poster

Graph is a prevalent discrete data structure, whose generation has wide applications such as drug discovery and circuit design. Diffusion generative models, as an emerging research focus, have been applied to graph generation tasks. Overall, according to the space of states and time steps, diffusion…

2024

Gradient Compressed Sensing: A Query-Efficient Gradient Estimator for High-Dimensional Zeroth-Order Optimization

ICML 2024poster

We study nonconvex zeroth-order optimization (ZOO) in a high-dimensional space $\mathbb R^d$ for functions with approximately $s$-sparse gradients. To reduce the dependence on the dimensionality $d$ in the query complexity, high-dimensional ZOO methods seek to leverage gradient sparsity to design gr…

2024

Graph Mixup on Approximate Gromov–Wasserstein Geodesics

ICML 2024poster

Mixup, which generates synthetic training samples on the data manifold, has been shown to be highly effective in augmenting Euclidean data. However, finding a proper data manifold for graph data is non-trivial, as graphs are non-Euclidean data in disparate spaces. Though efforts have been made, most…

Cited by 12SourcePDFScholar
2022

DIMES: A Differentiable Meta Solver for Combinatorial Optimization Problems

NeurIPS 2022accept

Recently, deep reinforcement learning (DRL) models have shown promising results in solving NP-hard Combinatorial Optimization (CO) problems. However, most DRL solvers can only scale to a few hundreds of nodes for combinatorial optimization problems on graphs, such as the Traveling Salesman Problem (…