Researcher profile

Yue Su

Yue Su contributes to research discovery and scholarly infrastructure.

ResearcherAffiliation not importedOpen to collaborate

Trust snapshot

Quick read

Trust 21 - EmergingVerification L1Unclaimed author
7works
0followers
11topics
4close collaborators

Actions

Decide how to stay connected

Follow researcher0

Identity and collaboration

How to connect with this researcher

Claiming links this public author record to a researcher profile and unlocks direct collaboration workflows.

Log in to claim

Direct collaboration

Open a focused conversation when the fit is right

Claim this author entity first to unlock direct invitations.

Research graph

See the researcher in context

Open full explorer

Inspect adjacent work, topics, institutions and collaborators without jumping out to a separate graph page.

Building this graph slice

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

7 published item(s)

preprint2026arXiv

CLAP: Contrastive Latent Action Pretraining for Learning Vision-Language-Action Models from Human Videos

Generalist Vision-Language-Action models are currently hindered by the scarcity of robotic data compared to the abundance of human video demonstrations. Existing Latent Action Models attempt to leverage video data but often suffer from visual entanglement, capturing noise rather than manipulation skills. To address this, we propose Contrastive Latent Action Pretraining (CLAP), a framework that aligns the visual latent space from videos with a proprioceptive latent space from robot trajectories. By employing contrastive learning, CLAP maps video transitions onto a quantized, physically executable codebook. Building on this representation, we introduce a dual-formulation VLA framework offering both CLAP-NTP, an autoregressive model excelling at instruction following and object generalization, and CLAP-RF, a Rectified Flow-based policy designed for high-frequency, precise manipulation. Furthermore, we propose a Knowledge Matching (KM) regularization strategy to mitigate catastrophic forgetting during fine-tuning. Extensive experiments demonstrate that CLAP significantly outperforms strong baselines, enabling the effective transfer of skills from human videos to robotic execution. Project page: https://lin-shan.com/CLAP/.

preprint2026arXiv

Combinatorial Optimization Augmented Machine Learning

Combinatorial optimization augmented machine learning (COAML) has recently emerged as a powerful paradigm for integrating predictive models with combinatorial decision-making. By embedding combinatorial optimization oracles into learning pipelines, COAML enables the construction of policies that are both data-driven and feasibility-preserving, bridging the traditions of machine learning, operations research, and stochastic optimization. This paper provides a comprehensive overview of the state of the art in COAML. We introduce a unifying framework for COAML pipelines, describe their methodological building blocks, and formalize their connection to empirical cost minimization. We then develop a taxonomy of problem settings based on the form of uncertainty and decision structure. Using this taxonomy, we review algorithmic approaches for static and dynamic problems, survey applications across domains such as scheduling, vehicle routing, stochastic programming, and reinforcement learning, and synthesize methodological contributions in terms of empirical cost minimization, imitation learning, and reinforcement learning. Finally, we identify key research frontiers. This survey aims to serve both as a tutorial introduction to the field and as a roadmap for future research at the interface of combinatorial optimization and machine learning.

preprint2026arXiv

Towards Generalist Game Players: An Investigation of Foundation Models in the Game Multiverse

The real world unfolds along a single set of physics laws, yet human intelligence demonstrates a remarkable capacity to generalize experiences from this singular physical existence into a multiverse of games, each governed by entirely different rules, aesthetics, physics, and objectives. This omni-reality adaptability is a hallmark of general intelligence. As Artificial Intelligence progresses towards Artificial General Intelligence, the multiverse of games has evolved from mere entertainment into the ultimate ground for training and evaluating AGI. The pursuit of this generality has unfolded across four eras: from environment-specific symbolic and reinforcement learning agents, to current large foundation models acting as generalist players, and toward a future creator stage where agent both creates new game worlds and continually evolves within them. We trace the full lifecycle of a generalist game player along four interdependent pillars: Dataset, Model, Harness, and Benchmark. Every advance across these pillars can be read as an attempt to break one of five fundamental trade-offs that currently bound the whole system. Building on this end-to-end view, we chart a five-level roadmap, progressing from single-game mastery to the ultimate creator stage in which the agent simultaneously creates and evolves within theoretical game multiverse. Taken together, our work offers a unified lens onto a rapidly shifting field,and a principled path toward the omnipotent generalist agent capable of seamlessly mastering any challenge within the multiverse of games, thereby paving the way for AGI.

preprint2025arXiv

$η$ and $η'$ mesons from $N_f = 2+1$ lattice QCD at the physical point using topological charge operators

By fitting the two-point correlation functions of topological charge density operators calculated on two $2+1$-flavor gauge ensembles with physical pion mass, we determine both the $η$ and $η'$ masses and also the mixing angle to be $m_η= 0.505(72)(75)$ GeV, $m_{η'}=0.952(47)(40)$ GeV, and $θ_1 = -8.9(2.1)(1.8)^\circ$, respectively, where the first error is the statistical uncertainty and the second one is the systematic uncertainty. This is the first extraction of both $η/η'$ masses and the mixing angle $θ_1$ using topological charge operators. Compared with previous studies using quark bilinear operators, the error of the $η$ mass is relatively large, but the mixing angle has comparable precision. This demonstrates that the topological charge operators are well suited to study the $η$ and $η'$ mesons.

preprint2024arXiv

A Branch-and-Price Algorithm for the Electric Autonomous Dial-A-Ride Problem

The Electric Autonomous Dial-A-Ride Problem (E-ADARP) consists in scheduling a fleet of electric autonomous vehicles to provide ride-sharing services for customers that specify their origins and destinations. The E-ADARP differs from the classical DARP in two aspects: (i) a weighted-sum objective that minimizes both total travel time and total excess user ride time; (ii) the employment of electric autonomous vehicles and a partial recharging policy. This paper presents a highly-efficient labeling algorithm, which is integrated into Branch-and-Price (B&P) algorithms to solve the E-ADARP. To handle (i), we introduce a fragment-based representation of paths. A novel approach is invoked to abstract fragments to arcs while ensuring excess-user-ride-time optimality. We then construct a new graph that preserves all feasible routes of the original graph by enumerating all feasible fragments, abstracting them to arcs, and connecting them with each other, depots, and recharging stations in a feasible way. On the new graph, partial recharging (ii) is tackled exactly by tailored Resource Extension Functions (REFs). We apply strong dominance rules and constant-time feasibility checks to compute the shortest paths efficiently. These methods construct the first labeling algorithm that can deal with minimizing (excess) user ride time. In the computational experiments, the B&P algorithm achieves optimality in 71 out of 84 instances. Remarkably, among these instances, 50 were solved optimally at the root node without branching. We identify 26 new best solutions, improve 30 previously reported lower bounds, and provide 17 new lower bounds for large-scale instances with up to 8 vehicles and 96 requests. In total 42 new best solutions are generated on previously solved and unsolved instances.

preprint2022arXiv

Model-based quantitative methods to predict irradiation-induced swelling in alloys

Predicting volume swelling of structural materials in nuclear reactors under high-dose neutron irradiations based on existing low-dose experiments or irradiation data with high-dose-rate energetic particles has been a long-standing challenge for safety evaluation and rapidly screening irradiation-resistant materials in nuclear energy systems. Here, we build an Additional Defect Absorption Model that describes the irradiation-induced swelling effects produced by energetic electrons, heavy-ions, and neutrons by considering additional defect sinks inherent in the irradiation process. Based on this model, we establish quantitative methods to predict high-dose swelling from low-dose behavior and obtain the equivalent irradiation dose for different energetic particles when the dose rates differ by several orders of magnitude. Furthermore, we propose a universal parameter to characterize the swelling resistance of various alloys and predict their radiation tolerances under different radiation conditions. This work provides quantitative prediction methods for evaluating irradiation-induced swelling effects of structural materials, which is critical to the safety and material development for advanced nuclear reactors.

preprint2020arXiv

Model selection criteria of the standard censored regression model based on the bootstrap sample augmentation mechanism

The statistical regression technique is an extraordinarily essential data fitting tool to explore the potential possible generation mechanism of the random phenomenon. Therefore, the model selection or the variable selection is becoming extremely important so as to identify the most appropriate model with the most optimal explanation effect on the interesting response. In this paper, we discuss and compare the bootstrap-based model selection criteria on the standard censored regression model (Tobit regression model) under the circumstance of limited observation information. The Monte Carlo numerical evidence demonstrates that the performances of the model selection criteria based on the bootstrap sample augmentation strategy will become more competitive than their alternative ones, such as the Akaike Information Criterion (AIC) and the Bayesian Information Criterion (BIC) etc. under the circumstance of the inadequate observation information. Meanwhile, the numerical simulation experiments further demonstrate that the model identification risk due to the deficiency of the data information, such as the high censoring rate and rather limited number of observations, can be adequately compensated by increasing the scientific computation cost in terms of the bootstrap sample augmentation strategies. We also apply the recommended bootstrap-based model selection criterion on the Tobit regression model to fit the real fidelity dataset.