Search arXiv⌕ Search

arXiv subjects

Hao Chen

Publications and source records attributed to Hao Chen.

At least 433 records · Page 24Linked to original sources

$3^{++}$ light meson family

As members of the $J^{PC}=3^{++}$ light meson family, the assignments of the $a_3(1875)$, $a_3(2030)$, $a_3(2275)$, $f_3(2050)$, and $f_3(2300)$ states remain unclear. In this work, we investigate the mass spectra and the Okubo-Zweig-Iizuka-allowed two-body strong decays of the $3^{++}$ light meson family using the modified Godfrey-Isgur quark model and the quark-pair creation model. We explore the identification of the $a_3(1875)$, $a_3(2030)$, $a_3(2275)$, $f_3(2050)$, and $f_3(2300)$ states. Additionally, we predict the masses and widths of the higher excitations in the $3^{++}$ light meson family.

hep-ph↗

Mitigating dimensionality effects with robust graph constructions for testing

Dimensionality effects pose major challenges in high-dimensional and non-Euclidean data analysis. Graph-based two-sample tests and change-point detection are particularly attractive in this context, as they make minimal distributional assumptions and perform well across a wide range of scenarios. These methods rely on similarity graphs constructed from data, with $K$-nearest neighbor graphs and $K$-minimum spanning trees among the most effective and widely used. However, in high-dimensional and non-Euclidean regimes such graphs often produce hubs -- nodes with disproportionately high degrees -- to which graph-based methods are especially sensitive. To mitigate these dimensionality effects, we propose a robust graph construction that is far less prone to hub formation. Incorporating this construction substantially improves the power of graph-based methods across diverse settings. We further establish a theoretical foundation by proving its consistency under fixed alternatives in both low- and high-dimensional regimes. The effectiveness of the approach is demonstrated through real-world applications, including comparisons of correlation matrices for brain regions, gene expression profiles of T cells, and temporal changes in New York City taxi travel patterns.

stat.ME↗

Diffusion Models are Efficient Data Generators for Human Mesh Recovery

Despite remarkable progress having been made on the problem of 3D human pose and shape estimation (HPS), current state-of-the-art methods rely heavily on either confined indoor mocap datasets or datasets generated by a rendering engine using computer graphics (CG). Both categories of datasets exhibit inadequacies in furnishing adequate human identities and authentic in-the-wild background scenes, which are crucial for accurately simulating real-world distributions. In this work, we show that synthetic data created by generative models is complementary to CG-rendered data for achieving remarkable generalization performance on diverse real-world scenes. We propose an effective data generation pipeline based on recent diffusion models, termed HumanWild, which can effortlessly generate human images and corresponding 3D mesh annotations. Specifically, we first collect a large-scale human-centric dataset with comprehensive annotations, e.g, text captions, the depth map, and surface normal images. To generate a wide variety of human images with initial labels, we train a customized, multi-condition ControlNet model. The key to this process is using a 3D parametric model, e.g, SMPL-X, to create various condition inputs easily. Our data generation pipeline is both flexible and customizable, making it adaptable to multiple real-world tasks, such as human interaction in complex scenes and humans captured by wide-angle lenses. By relying solely on generative models, we can produce large-scale, in-the-wild human images with high-quality annotations, significantly reducing the need for manual image collection and annotation. The generated dataset encompasses a wide range of viewpoints, environments, and human identities, ensuring its versatility across different scenarios. We hope that our work could pave the way for scaling up 3D human recovery to in-the-wild scenes.

cs.CV↗

Topological Structure Learning Should Be A Research Priority for LLM-Based Multi-Agent Systems

Large Language Model-based Multi-Agent Systems (MASs) have emerged as a powerful paradigm for tackling complex tasks through collaborative intelligence. However, the topology of these systems--how agents in MASs should be configured, connected, and coordinated--remains largely unexplored. In this position paper, we call for a paradigm shift toward \emph{topology-aware MASs} that explicitly model and dynamically optimize the structure of inter-agent interactions. We identify three fundamental components--agents, communication links, and overall topology--that collectively determine the system's adaptability, efficiency, robustness, and fairness. To operationalize this vision, we introduce a systematic three-stage framework: 1) agent selection, 2) structure profiling, and 3) topology synthesis. This framework not only provides a principled foundation for designing MASs but also opens new research frontiers across language modeling, reinforcement learning, graph learning, and generative modeling to ultimately unleash their full potential in complex real-world applications. We conclude by outlining key challenges and opportunities in MASs evaluation. We hope our framework and perspectives offer critical new insights in the era of agentic AI.

cs.MA↗

Merge-of-Thought Distillation

Efficient reasoning distillation for long chain-of-thought (CoT) models is increasingly constrained by the assumption of a single oracle teacher, despite the practical availability of multiple candidate teachers and growing CoT corpora. We revisit teacher selection and observe that different students have different "best teachers," and even for the same student, the best teacher can vary across datasets. Therefore, to unify multiple teachers' reasoning abilities into a student to overcome conflicts among various teachers' supervision, we propose Merge-of-Thought Distillation (MoT), a lightweight framework that alternates between teacher-specific supervised fine-tuning branches and weight-space merging of the resulting student variants. On competition math benchmarks, using only about 200 CoT samples, applying MoT to a Qwen3-14B student surpasses strong models including Deepseek-R1, Qwen3-32B, and OpenAI-O1, demonstrating substantial gains. Besides, MoT consistently outperforms the best single-teacher distillation, improves general reasoning beyond mathematics while reducing catastrophic forgetting, and shows robustness to distribution-shifted and peer-level teachers. Finally, we have demonstrated MoT possesses consensus CoT by eliminating teacher-specific inductive biases and inter-teacher conflicts while repeatedly reinforcing the learning of consensus reasoning features. These results position MoT as a simple, effective route to efficiently distilling long CoT capabilities from diverse teachers into compact students.

cs.LG↗

Revisit Modality Imbalance at the Decision Layer

Multimodal learning integrates information from different modalities to enhance model performance, yet it often suffers from modality imbalance, where dominant modalities overshadow weaker ones during joint optimization. This paper reveals that such an imbalance not only occurs during representation learning but also manifests significantly at the decision layer. Experiments on audio-visual datasets (CREMAD and Kinetic-Sounds) show that even after extensive pretraining and balanced optimization, models still exhibit systematic bias toward certain modalities, such as audio. Further analysis demonstrates that this bias originates from intrinsic disparities in feature-space and decision-weight distributions rather than from optimization dynamics alone. We argue that aggregating uncalibrated modality outputs at the fusion stage leads to biased decision-layer weighting, hindering weaker modalities from contributing effectively. To address this, we propose that future multimodal systems should focus more on incorporate adaptive weight allocation mechanisms at the decision layer, enabling relative balanced according to the capabilities of each modality.

cs.LG↗

Exploring Image Representation with Decoupled Classical Visual Descriptors

Exploring and understanding efficient image representations is a long-standing challenge in computer vision. While deep learning has achieved remarkable progress across image understanding tasks, its internal representations are often opaque, making it difficult to interpret how visual information is processed. In contrast, classical visual descriptors (e.g. edge, colour, and intensity distribution) have long been fundamental to image analysis and remain intuitively understandable to humans. Motivated by this gap, we ask a central question: Can modern learning benefit from these classical cues? In this paper, we answer it with VisualSplit, a framework that explicitly decomposes images into decoupled classical descriptors, treating each as an independent but complementary component of visual knowledge. Through a reconstruction-driven pre-training scheme, VisualSplit learns to capture the essence of each visual descriptor while preserving their interpretability. By explicitly decomposing visual attributes, our method inherently facilitates effective attribute control in various advanced visual tasks, including image generation and editing, extending beyond conventional classification and segmentation, suggesting the effectiveness of this new learning approach for visual understanding. Project page: https://chenyuanqu.com/VisualSplit/.

cs.CV↗

Improving Transferability of Adversarial Examples via Bayesian Attacks

The transferability of adversarial examples allows for the attack on unknown deep neural networks (DNNs), posing a serious threat to many applications and attracting great attention. In this paper, we improve the transferability of adversarial examples by incorporating the Bayesian formulation into both the model parameters and model input, enabling their joint diversification. We demonstrate that combination of Bayesian formulations for both the model input and model parameters yields significant improvements in transferability. By introducing advanced approximations of the posterior distribution over the model input, adversarial transferability achieves further enhancement, surpassing all state-of-the-arts when attacking without model fine-tuning. Additionally, we propose a principled approach to fine-tune model parameters within this Bayesian framework. Extensive experiments demonstrate that our method achieves a new state-of-the-art in transfer-based attacks, significantly improving the average success rate on ImageNet and CIFAR-10. Code at: https://github.com/qizhangli/MoreBayesian-jrnl.

cs.LG↗

Self-dual codes and LCD codes in sum-rank metric

Sum-rank codes are an important class of codes which can be utilized for linear network coding, space-time coding and distributed storage. They can not only reduce the size of network alphabet but also detect and correct more errors. Based on the duality theory of sum-rank codes [Byrne, Gluesing-Luerssen, Ravagnani, IEEE TIT, 2021] and those related theory of rank-metric codes, it is significant to study self-dual codes and linear complementary dual (LCD) codes in sum-rank metric. In this paper, we introduce the notion of self-dual codes and LCD codes in sum-rank metric, and obtain two methods of constructing self-dual sum-rank codes and LCD sum-rank codes from Euclidean self-dual codes and Euclidean LCD codes. Some examples of cyclic self-dual sum-rank codes and cyclic LCD sum-rank codes with good parameters are provided. In addition, we prove that there exist asymptotically good self-dual sum-rank codes.

cs.IT↗

Mixup Helps Understanding Multimodal Video Better

Multimodal video understanding plays a crucial role in tasks such as action recognition and emotion classification by combining information from different modalities. However, multimodal models are prone to overfitting strong modalities, which can dominate learning and suppress the contributions of weaker ones. To address this challenge, we first propose Multimodal Mixup (MM), which applies the Mixup strategy at the aggregated multimodal feature level to mitigate overfitting by generating virtual feature-label pairs. While MM effectively improves generalization, it treats all modalities uniformly and does not account for modality imbalance during training. Building on MM, we further introduce Balanced Multimodal Mixup (B-MM), which dynamically adjusts the mixing ratios for each modality based on their relative contributions to the learning objective. Extensive experiments on several datasets demonstrate the effectiveness of our methods in improving generalization and multimodal robustness.

cs.CV↗

Quantized Transport of $ν= 2/3$ Fractional Quantum Hall Edge with Disordered Superconducting Proximity

Quantum Hall edge states in proximity to a superconductor (SC) usually acquire a non-quantized electron-to-hole conversion probability in transport, due to non-universal SC couplings and disorders. With counter-propagating modes, we show that the situation can be the opposite in the $ν=2/3$ fractional quantum Hall (FQH) edge states with SC proximity, where disordered SC-couplings can reconstruct the edge states into an infinite set of stable phases with quantized electron-to-hole conversion probability along a long edge. Each phase is dominated by a disordered SC-coupling that tunnels $\pm |q_N|$ Cooper pairs, which can take values $|q_N|=1, 4, 15$, etc. We predict that this gives rise to a quantized downstream resistance $R_d = h/(2q^2_Ne^2)$ in an FQH-SC junction, serving as a quantized electrical transport signature beyond the Hall conductance. Higher-order nonlinear transport due to irrelevant Cooper pair tunneling or vortex dissipation is further studied, which becomes dominant when the edge is in a normal phase. Our results apply to both the single-layer state (as a particle-hole conjugate of $ν=1/3$) and the bilayer Halperin-(112) state, revealing a rich landscape of disorder-stabilized phases in FQH edge states with SC proximity, and may as well apply to fractional Chern insulators recently observed at the same filling.

cond-mat.mes-hall↗

A Clinical-grade Universal Foundation Model for Intraoperative Pathology

Intraoperative pathology is pivotal to precision surgery, yet its clinical impact is constrained by diagnostic complexity and the limited availability of high-quality frozen-section data. While computational pathology has made significant strides, the lack of large-scale, prospective validation has impeded its routine adoption in surgical workflows. Here, we introduce CRISP, a clinical-grade foundation model developed on over 100,000 frozen sections from eight medical centers, specifically designed to provide Clinical-grade Robust Intraoperative Support for Pathology (CRISP). CRISP was comprehensively evaluated on more than 15,000 intraoperative slides across nearly 100 retrospective diagnostic tasks, including benign-malignant discrimination, key intraoperative decision-making, and pan-cancer detection, etc. The model demonstrated robust generalization across diverse institutions, tumor types, and anatomical sites-including previously unseen sites and rare cancers. In a prospective cohort of over 2,000 patients, CRISP sustained high diagnostic accuracy under real-world conditions, directly informing surgical decisions in 92.6% of cases. Human-AI collaboration further reduced diagnostic workload by 35%, avoided 105 ancillary tests and enhanced detection of micrometastases with 87.5% accuracy. Together, these findings position CRISP as a clinical-grade paradigm for AI-driven intraoperative pathology, bridging computational advances with surgical precision and accelerating the translation of artificial intelligence into routine clinical practice.

cs.LG↗

Unified Open-World Segmentation with Multi-Modal Prompts

In this work, we present COSINE, a unified open-world segmentation model that consolidates open-vocabulary segmentation and in-context segmentation with multi-modal prompts (e.g., text and image). COSINE exploits foundation models to extract representations for an input image and corresponding multi-modal prompts, and a SegDecoder to align these representations, model their interaction, and obtain masks specified by input prompts across different granularities. In this way, COSINE overcomes architectural discrepancies, divergent learning objectives, and distinct representation learning strategies of previous pipelines for open-vocabulary segmentation and in-context segmentation. Comprehensive experiments demonstrate that COSINE has significant performance improvements in both open-vocabulary and in-context segmentation tasks. Our exploratory analyses highlight that the synergistic collaboration between using visual and textual prompts leads to significantly improved generalization over single-modality approaches.

cs.CV↗

Starburst galaxies in the Hydra I cluster

We present a new catalog of 196 galaxies of the nearby Hydra I cluster out to $\sim$1.75$\rm r_{200}$, consisting of broad u,g,r,i,z along with narrowband H$α$ measurements. These deep optical images were obtained with the DECam camera (CTIO) and reach down to a surface brightness limit of $μ( 3σ;10''\times10'')$=26.9 mag $\rm arcsec^2$ in the g band. We also report the HI properties for 89 cluster members detected with MeerKAT. A color magnitude diagram (CMD) shows a bimodal distribution typical of a cluster population, more evolved than those found in isolation. We combine optical H$α$ and WISE infrared data to compare the star formation history at two distinct timescales. Differences in the star forming activity depicted by both populations manifest as starburst in 24 found members. Of these, 18 starburst galaxies have neutral gas measurements, and show disturbed HI disks that suggest an environmentally-triggered boost in star formation within the last 10$^7$ yrs. Processes such as ram pressure stripping or tidal interactions may underlie their enhanced star-forming activity and asymmetric disks. Since Hydra's dynamical history is unclear, we examine the spatial and velocity distribution of the sample. We reveal a possible link between the large scale structure feeding the Hydra I cluster and the heightened star-forming activity of the starburst galaxies. This feeding pattern matches the few substructure that has been identified in Hydra in previous works, and may explain its origin. Our results portray a picture of a cluster with an evolved nature, plus a population of new infalling galaxies that manifest the impact of their first contact with the cluster environment through star formation, color, morphology and gas content transformations.

astro-ph.GA↗

OpenRLHF: An Easy-to-use, Scalable and High-performance RLHF Framework

Large Language Models (LLMs) fine-tuned via Reinforcement Learning from Human Feedback (RLHF) and Reinforcement Learning with Verifiable Rewards (RLVR) significantly improve the alignment of human-AI values, further raising the upper bound of AI capabilities, particularly in reasoning-intensive, long-context Chain-of-Thought (CoT) tasks. However, existing frameworks commonly face challenges such as inference bottlenecks and complexity barriers, which restrict their accessibility to newcomers. To bridge this gap, we introduce \textbf{OpenRLHF}, a user-friendly, scalable, and easy-to-learn open-source RLHF framework built upon Ray, vLLM, DeepSpeed, and HuggingFace Transformers, featuring a simplified design, clear code structure, and comprehensive documentation to facilitate entry for researchers and practitioners. Experimental results show that OpenRLHF achieves superior training efficiency, with speedups ranging from 1.22x to 1.68x across different model sizes, compared to state-of-the-art frameworks. Additionally, it requires significantly fewer lines of code for implementation. OpenRLHF is publicly available at https://github.com/OpenRLHF/OpenRLHF, and has already been adopted by leading institutions to accelerate RLHF research and learning.

cs.AI↗

DICEPTION: A Generalist Diffusion Model for Visual Perceptual Tasks

This paper's primary objective is to develop a robust generalist perception model capable of addressing multiple tasks under constraints of computational resources and limited training data. We leverage text-to-image diffusion models pre-trained on billions of images and successfully introduce our DICEPTION, a visual generalist model. Exhaustive evaluations demonstrate that DICEPTION effectively tackles diverse perception tasks, even achieving performance comparable to SOTA single-task specialist models. Specifically, we achieve results on par with SAM-vit-h using only 0.06% of their data (e.g., 600K vs.\ 1B pixel-level annotated images). We designed comprehensive experiments on architectures and input paradigms, demonstrating that the key to successfully re-purposing a single diffusion model for multiple perception tasks lies in maximizing the preservation of the pre-trained model's prior knowledge. Consequently, DICEPTION can be trained with substantially lower computational costs than conventional models requiring training from scratch. Furthermore, adapting DICEPTION to novel tasks is highly efficient, necessitating fine-tuning on as few as 50 images and approximately 1% of its parameters. Finally, we demonstrate that a subtle application of classifier-free guidance can improve the model's performance on depth and normal estimation. We also show that pixel-aligned training, as is characteristic of perception tasks, significantly enhances the model's ability to preserve fine details. DICEPTION offers valuable insights and presents a promising direction for the development of advanced diffusion-based visual generalist models. Code and Model: https://github.com/aim-uofa/Diception

cs.CV↗

SkipSR: Faster Super Resolution with Token Skipping

Diffusion-based super-resolution (SR) is a key component in video generation and video restoration, but is slow and expensive, limiting scalability to higher resolutions and longer videos. Our key insight is that many regions in video are inherently low-detail and gain little from refinement, yet current methods process all pixels uniformly. To take advantage of this, we propose SkipSR, a simple framework for accelerating video SR by identifying low-detail regions directly from low-resolution input, then skipping computation on them entirely, only super-resolving the areas that require refinement. This simple yet effective strategy preserves perceptual quality in both standard and one-step diffusion SR models while significantly reducing computation. In standard SR benchmarks, our method achieves up to 60% faster end-to-end latency than prior models on 720p videos with no perceptible loss in quality. Video demos are available at https://rccchoudhury.github.io/skipsr/

cs.CV↗

Space Logistics Analysis and Incentive Design for Commercialization of Orbital Debris Remediation

As orbital debris continues to become a higher priority for the space industry, there is a need to explore how partnerships between the public and private space sector may aid in addressing this issue. This research develops a space logistics framework for planning orbital debris remediation missions, providing a quantitative basis for partnerships that are mutually beneficial between space operators and debris remediators. By integrating network-based space logistics and game theory, we illuminate the high-level costs of remediating orbital debris, and the surplus that stands to be shared as a result. These findings indicate significant progress toward the continued development of a safe, sustainable, and profitable space economy.

eess.SY↗