Source author record

Chu Wang

Chu Wang appears in the imported research catalog. Authorship, coauthor and topic links are available while profile ownership is still unclaimed.

ResearcherUnclaimed source record

Catalog footprint

What is connected

17works
14topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

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

Published work

17 published item(s)

preprint2026arXiv

Knowledge Transfer Scaling Laws for 3D Medical Imaging

Vision foundation models are increasingly moving beyond 2D to volumetric domains such as 3D medical imaging, where unified pretraining across different imaging modalities (i.e. CT, MRI, and PET) could provide foundational models for diverse clinical tasks. However, training such models requires mixing heterogeneous imaging domains, and current mixture strategies remain largely heuristic. In this work, we observe that different medical imaging domains scale at variable rates during pretraining, and knowledge transfer between domains is strongly asymmetric: training on one domain can substantially improve another, but the reverse may be much weaker. Interestingly, both MAE reconstruction loss and cross-domain transfer follow predictable power-law trends with domain-specific behaviors. Motivated by these findings, we formulate data allocation as a scaling-law optimization problem. The derived allocations reveal an interpretable hub-and-island structure: highly transferable domains emerge as hubs that benefit many others and deserve strategic allocation, while isolated domains act as islands requiring direct investment. Empirically, transfer-aware allocation outperforms data-proportional sampling by up to 58% and generalizes well to unseen budgets with r=0.989. Downstream validation on disease classification and organ/lesion segmentation further confirms that the derived transfer-aware mixtures provide stronger pretrained representations for clinical 3D medical imaging tasks.

preprint2026arXiv

Scalable Machine Learning Force Fields for Macromolecular Systems Through Long-Range Aware Message Passing

Machine learning force fields (MLFFs) have revolutionized molecular simulations by providing quantum mechanical accuracy at the speed of molecular mechanical computations. However, a fundamental reliance of these models on fixed-cutoff architectures limits their applicability to macromolecular systems where long-range interactions dominate. We demonstrate that this locality constraint causes force prediction errors to scale monotonically with system size, revealing a critical architectural bottleneck. To overcome this, we establish the systematically designed MolLR25 ({Mol}ecules with {L}ong-{R}ange effect) benchmark up to 1200 atoms, generated using high-fidelity DFT, and introduce E2Former-LSR, an equivariant transformer that explicitly integrates long-range attention blocks. E2Former-LSR exhibits stable error scaling, achieves superior fidelity in capturing non-covalent decay, and maintains precision on complex protein conformations. Crucially, its efficient design provides up to 30% speedup compared to purely local models. This work validates the necessity of non-local architectures for generalizable MLFFs, enabling high-fidelity molecular dynamics for large-scale chemical and biological systems.

preprint2022arXiv

Search for a lighter neutral custodial fiveplet scalar in the Georgi-Machacek model

Many researches from both the theoretical and experimental sides have been performed to search for a new Higgs Boson lighter than the 125 $GeV$ Higgs boson which was discovered at the LHC in 2012. In this paper we explore the possibility of constraining a lighter neutral custodial fiveplet scalar $H_{5}^{0}$ in the Georgi-Machacek (GM) model by the latest results of the search for a lighter Higgs boson decaying into two photons from LHC data. The custodial-singlet mass eigenstate $h$ or $H$ is considered to be the LHC observed 125 $GeV$ Higgs boson. A new set of constrained parameters that is favoured by low-mass $H_{5}^{0}$, is proposed to generate events efficiently. The production of $H_{5}^{0}$ from the scan based on the constrained parameters is compared to the latest results of the search for a lighter Higgs boson decaying into two photons by CMS Collaboration, after the theoretical constraints from GM model and the constraints from all existing relevant experimental measurements including the recent results of the Higgs boson searches from the LHC. The numerical analyses of the surviving GM parameter space are performed. The tendencies and correlations of the GM input parameters from the phenomenological studies are summarized. In addition the discovery potential of other interesting decay channels of this low-mass neutral custodial fiveplet scalar are discussed.

preprint2020arXiv

Affinity Graph Supervision for Visual Recognition

Affinity graphs are widely used in deep architectures, including graph convolutional neural networks and attention networks. Thus far, the literature has focused on abstracting features from such graphs, while the learning of the affinities themselves has been overlooked. Here we propose a principled method to directly supervise the learning of weights in affinity graphs, to exploit meaningful connections between entities in the data source. Applied to a visual attention network, our affinity supervision improves relationship recovery between objects, even without the use of manually annotated relationship labels. We further show that affinity learning between objects boosts scene categorization performance and that the supervision of affinity can also be applied to graphs built from mini-batches, for neural network training. In an image classification task we demonstrate consistent improvement over the baseline, with diverse network architectures and datasets.

preprint2016arXiv

An Opinion Dynamics Model with Increasing Self-Confidence

We propose an opinion dynamics model in which agents gradually increase their own self-confidence while interacting with each other. The relations between the newly proposed model and existing works of social learning, inertial opinion dynamics, Bayesian inference, and stochastic multi-armed bandits are demonstrated. We prove the convergence of the system with the existence of a truth under fixed and periodically changing social networks, and obtain tight convergence bounds related to the spectral gap of the graph Laplacian and the maximum total degree centrality, respectively. In the case of randomly generated social networks, an almost-sure convergence result is obtained. The dynamics of the model with multiple truths or zero truth is also discussed.

preprint2016arXiv

Gaussian Learning-Without-Recall in a Dynamic Social Network

We analyze the dynamics of the Learning-Without-Recall model with Gaussian priors in a dynamic social network. Agents seeking to learn the state of the world, the "truth", exchange signals about their current beliefs across a changing network and update them accordingly. The agents are assumed memoryless and rational, meaning that they Bayes-update their beliefs based on current states and signals, with no other information from the past. The other assumption is that each agent hears a noisy signal from the truth at a frequency bounded away from zero. Under these conditions, we show that the system reaches truthful consensus almost surely with a convergence rate that is polynomial in expectation. Somewhat paradoxically, high outdegree can slow down the learning process. The lower-bound assumption on the truth-hearing frequency is necessary: even infinitely frequent access to the truth offers no guarantee of truthful consensus in the limit.

preprint2016arXiv

Inertial Hegselmann-Krause Systems

We derive an energy bound for inertial Hegselmann-Krause (HK) systems, which we define as a variant of the classic HK model in which the agents can change their weights arbitrarily at each step. We use the bound to prove the convergence of HK systems with closed-minded agents, which settles a conjecture of long standing. This paper also introduces anchored HK systems and show their equivalence to the symmetric heterogeneous model.

preprint2016arXiv

Self-Sustaining Iterated Learning

An important result from psycholinguistics (Griffiths & Kalish, 2005) states that no language can be learned iteratively by rational agents in a self-sustaining manner. We show how to modify the learning process slightly in order to achieve self-sustainability. Our work is in two parts. First, we characterize iterated learnability in geometric terms and show how a slight, steady increase in the lengths of the training sessions ensures self-sustainability for any discrete language class. In the second part, we tackle the nondiscrete case and investigate self-sustainability for iterated linear regression. We discuss the implications of our findings to issues of non-equilibrium dynamics in natural algorithms.

preprint2015arXiv

Functional Frank-Wolfe Boosting for General Loss Functions

Boosting is a generic learning method for classification and regression. Yet, as the number of base hypotheses becomes larger, boosting can lead to a deterioration of test performance. Overfitting is an important and ubiquitous phenomenon, especially in regression settings. To avoid overfitting, we consider using $l_1$ regularization. We propose a novel Frank-Wolfe type boosting algorithm (FWBoost) applied to general loss functions. By using exponential loss, the FWBoost algorithm can be rewritten as a variant of AdaBoost for binary classification. FWBoost algorithms have exactly the same form as existing boosting methods, in terms of making calls to a base learning algorithm with different weights update. This direct connection between boosting and Frank-Wolfe yields a new algorithm that is as practical as existing boosting methods but with new guarantees and rates of convergence. Experimental results show that the test performance of FWBoost is not degraded with larger rounds in boosting, which is consistent with the theoretical analysis.

preprint2015arXiv

Noisy Hegselmann-Krause Systems: Phase Transition and the 2R-Conjecture

The classic Hegselmann-Krause (HK) model for opinion dynam- ics consists of a set of agents on the real line, each one instructed to move, at every time step, to the mass center of all the agents within a fixed distance R. In this work, we investigate the effects of noise in the continuous-time version of the model as described by its mean-field limiting Fokker-Planck equation. In the presence of a finite number of agents, the system exhibits a phase transition from order to disorder as the noise increases. The ordered phase features clusters whose width depends only on the noise level. We introduce an order parameter to track the phase transition and resolve the corresponding phase dia- gram. The system undergoes a phase transition for small R but none for larger R. Based on the stability analysis of the mean-field equation, we derive the existence of a forbidden zone for the disordered phase to emerge. We also provide a theoretical explanation for the well-known 2R conjecture, which states that, for a random initial distribution in a fixed interval, the final configuration consists of clusters separated by a distance of roughly 2R. Our theoretical analysis also confirms previous simulations and predicts properties of the noisy HK model in higher dimension.

preprint2015arXiv

The Knowledge Gradient with Logistic Belief Models for Binary Classification

We consider sequential decision making problems for binary classification scenario in which the learner takes an active role in repeatedly selecting samples from the action pool and receives the binary label of the selected alternatives. Our problem is motivated by applications where observations are time consuming and/or expensive, resulting in small samples. The goal is to identify the best alternative with the highest response. We use Bayesian logistic regression to predict the response of each alternative. By formulating the problem as a Markov decision process, we develop a knowledge-gradient type policy to guide the experiment by maximizing the expected value of information of labeling each alternative and provide a finite-time analysis on the estimated error. Experiments on benchmark UCI datasets demonstrate the effectiveness of the proposed method.

preprint2015arXiv

Well-Posedness of the Limiting Equation of a Noisy Consensus Model in Opinion Dynamics

This paper establishes the global well-posedness of the nonlinear Fokker-Planck equation for a noisy version of the Hegselmann-Krause model. The equation captures the mean-field behavior of a classic multiagent system for opinion dynamics. We prove the global existence, uniqueness, nonnegativity and regularity of the weak solution. We also exhibit a global stability condition, which delineates a forbidden region for consensus formation. This is the first nonlinear stability result derived for the Hegselmann-Krause model.

preprint2014arXiv

A brain-wide association study of DISC1 genetic variants reveals a relationship with the structure and functional connectivity of the precuneus in schizophrenia

The Disrupted in Schizophrenia Gene 1 (DISC1) plays a role in both neural signalling and development and is associated with schizophrenia, although its links to altered brain structure and function in this disorder are not fully established. Here we have used structural and functional MRI to investigate links with six DISC1 single nucleotide polymorphisms (SNPs). We employed a brain-wide association analysis (BWAS) together with a Jacknife internal validation approach in 46 schizophrenia patients and 24 matched healthy control subjects. Results from structural MRI showed significant associations between all six DISC1 variants and gray matter volume in the precuneus, post-central gyrus and middle cingulate gyrus. Associations with specific SNPs were found for rs2738880 in the left precuneus and right post-central gyrus, and rs1535530 in the right precuneus and middle cingulate gyrus. Using regions showing structural associations as seeds a resting-state functional connectivity analysis revealed significant associations between all 6 SNPS and connectivity between the right precuneus and inferior frontal gyrus. The connection between the right precuneus and inferior frontal gyrus was also specifically associated with rs821617. Importantly schizophrenia patients showed positive correlations between the six DISC-1 SNPs associated gray matter volume in the left precuneus and right post-central gyrus and negative symptom severity. No correlations with illness duration were found. Our results provide the first evidence suggesting a key role for structural and functional connectivity associations between DISC1 polymorphisms and the precuneus in schizophrenia.

preprint2014arXiv

Lifts of Non-compact Convex Sets and Cone Factorizations

In this paper we generalize the factorization theorem of Gouveia, Parrilo and Thomas to a broader class of convex sets. Given a general convex set, we define a slack operator associated to the set and its polar according to whether the convex set is full dimensional, whether it is a translated cone and whether it contains lines. We strengthen the condition of a cone lift by requiring not only the convex set is the image of an affine slice of a given closed convex cone, but also its recession cone is the image of the linear slice of the closed convex cone. We show that the generalized lift of a convex set can also be characterized by the cone factorization of a properly defined slack operator.

preprint2014arXiv

Semidefinite representations of non-compact convex sets

We consider the problem of the semidefinite representation of a class of non-compact basic semialgebraic sets. We introduce the conditions of pointedness and closedness at infinity of a semialgebraic set and show that under these conditions our modified hierarchies of nested theta bodies and Lasserre's relaxations converge to the closure of the convex hull of $S$. Moreover, if the PP-BDR property is satisfied, our theta body and Lasserre's relaxation are exact when the order is large enough; if the PP-BDR property does not hold, our hierarchies convergent uniformly to the closure of the convex hull of $S$ restricted to every fixed ball centered at the origin. We illustrate through a set of examples that the conditions of pointedness and closedness are essential to ensure the convergence. Finally, we provide some strategies to deal with cases where the conditions of pointedness and closedness are violated.

preprint2012arXiv

A certificate for semidefinite relaxations in computing positive dimensional real varieties

For an ideal I with a positive dimensional real variety, based on moment relaxations, we study how to compute a Pommaret basis which is simultaneously a Groebner basis of an ideal J generated by the kernel of a truncated moment matrix and nesting between I and its real radical ideal. We provide a certificate consisting of a condition on coranks of moment matrices for terminating the algorithm. For a generic delta-regular coordinate system, we prove that the condition is satisfiable in a large enough order of moment relaxations.