Searcharxiv⌕ Search

arXiv subjects

Ying Tang

Publications and source records attributed to Ying Tang.

At least 19 recordsLinked to original sources

Hierarchical interfacial anchoring for durable perovskite solar cells

Although inverted perovskite solar cells now deliver certified efficiencies approaching their single-junction limits, their practical deployment remains constrained by the thermo-mechanical fragility of buried interfaces under realistic temperature fluctuations. Here, we identify thermo-mechanically driven, stress-accumulation-dominated adhesion failure at self-assembled monolayer-based buried interfaces as a critical failure mode in inverted perovskite solar cells. To address this issue, we propose an interfacial robustness design strategy based on a homometallic halide pretreatment, which constructs a chemically compatible and highly anchorable interfacial environment on transparent conductive oxides to guide the ordered assembly of SAMs. This interfacial treatment increases the density of surface hydroxyl species and enables hierarchical multipoint interfacial anchoring dominated by metal-oxygen coordination, with Cl- induced hydrogen-bonding interactions acting cooperatively, thereby enhancing anchoring robustness and improving tolerance to thermo-mechanical stress accumulation. With this interfacial strategy, the devices achieve a power conversion efficiency of 27.3% (26.9% certified) and retain 94% of their initial efficiency after 400 temperature cycles between -40 and 85 degrees C (ISOS-T-3). These results demonstrate that rational regulation of buried interfacial anchoring architectures can simultaneously enhance device efficiency and long-term operational reliability, offering a viable pathway toward high-efficiency and durable perovskite photovoltaics.

physics.optics↗

Dynamic Molecular Transformation Mediated Crystallization Regulation and Interface Passivation in Tin Based Perovskite Solar Cells

Tin-based perovskites are promising candidates for lead-free photovoltaics but suffer from labile Sn$^{2+}$ coordination, rapid crystallization, and severe interfacial defects. Here, we develop a dynamic molecular transformation using 1-acetylpiperazine (PX) to regulate crystallization and interface chemistry simultaneously. During nucleation and growth, the carbonyl group coordinates with Sn$^{2+}$ to stabilize precursor complexes, moderate supersaturation, and enable controlled crystal growth. Upon annealing, PX undergoes in situ molecular transformation, suggested to form amidinium-functionalized species that preferentially occupy surface A-site vacancies, forming a passivation layer and suppressing nonradiative recombination. This coupled bulk-to-interface evolution yields compact, highly crystalline films with improved optoelectronic quality. Devices achieve a power conversion efficiency of 15.18% and retain 94.1% of initial efficiency after 500 h of continuous illumination. This work demonstrates a dynamic molecular engineering approach integrating crystallization control and interface passivation, providing a pathway toward efficient and stable lead-free perovskite photovoltaics.

physics.optics↗

Phase Kernel Lifts Capacity of Dense Associative Memory

Dense associative memory underlies modern attention mechanisms; however, Modern Hopfield Networks (MHNs) with linear kernels yield overlapping attractor basins and spurious states under high memory load, limiting their theoretically exponential storage capacity in practice. We construct a class of nonlinear phase kernels that modify the energy landscape and retrieval dynamics, and prove that these kernels preserve exponential storage capacity and local fixed-point convergence under given conditions on kernel smoothness, memory separation, and memory distributions. The framework is instantiated by the Sigmoidal Phase Hopfield Network (S-Hop), which guarantees monotone energy descent and mitigates practical capacity loss. S-Hop has $8.3\times$ and $4\times$ gains in one-step noisy retrieval load over Uniform Hopfield Networks (U-Hop) on CIFAR-10 and TinyImageNet respectively, and reaches a $50\times$ gain in first-failure load for ImageNet. The results demonstrate that phase kernels provide a principled route to robust dense associative memory.

cs.LG↗

Tracking large chemical reaction networks and rare events by neural networks

Chemical reaction networks are widely used to model stochastic dynamics in biophysical processes. Their exact probabilistic description via the chemical master equation becomes intractable for high-dimensional systems due to the exponential growth of the state space. This difficulty is further exacerbated when metastable transitions and rare events dominate the dynamics. Here, we present an advanced neural-network approach that effectively tackles large reaction networks and rare-event dynamics within a unified framework. Building on autoregressive representations of the full joint probability distribution, we achieve efficient training through second-order optimization methods, including natural gradient descent and the time-dependent variational principle. We leverage enhanced-sampling strategies that enable accurate resolution of low-probability regions governing rare transitions. We demonstrate the method on a multistable genetic toggle switch and a mitogen-activated protein kinase (MAPK) cascade consisting of 16 species and 35 reactions with dense coupling. We further quantify rare events in spatially extended Schlögl models in both one- and two-dimensional lattices, reaching system sizes with extremely large state spaces up to $3\times10^{15}$. These results highlight the potential of neural modeling as a flexible and scalable framework for studying high-dimensional chemical reaction networks and rare events.

q-bio.MN↗

Proximal Causal Learning under Unmeasured Confounding

Estimating treatment effects from observational data typically relies on the No Unmeasured Confounding Assumption (NUCA), which rarely holds in practice. Proximal causal learning (PCL) addresses unmeasured confounding via proxy variables, yet existing methods require the proxy variables to be pre-specified. Thus, we propose PCL-U, a framework that learns proxy variables directly from observed covariates. PCL-U uses neural encoders to decompose covariates into treatment-inducing, outcome-inducing, and shared proxies, guided by minimax mutual information objectives, and obtains causal estimates through a practical moment-based risk function. Experiments on benchmarks show that PCL-U matches or outperforms existing baselines. Besides, there are two types of synthetic datasets with varying dimensions and confounding strengths that illustrate that our method maintains stable estimation accuracy.

cs.LG↗

Nonequilibrium Dynamics of Simple Exclusion Processes Across Dimensions

The simple exclusion process (SEP) is a paradigmatic model for nonequilibrium transport, yet its rich dynamics over an exponentially large configuration space remain notoriously intractable. Here, we leverage variational autoregressive networks to characterize the nonequilibrium dynamics of the symmetric (SSEP), asymmetric (ASEP), and totally asymmetric (TASEP) cases in one to three dimensions at any time. We validate the approach against established finite-time 1D and long-time 2D results for the SSEP, and further provide new results on dynamical activity, density fields and nonequilibrium phase transitions for 2D and 3D cases. In 2D, we give a directional-density criterion connecting the bulk-density organization to the 1D TASEP phase diagram, and reveal how boundary and bulk rates separately control the activity and susceptibility. In 3D, we provide the first finite-time characterization of the SSEP active-inactive phase transition, and uncover scaling relations over time. Across dimensions, the critical field follows a trend $s_c\sim L^{-2}$, suggesting tuning strategies by the characteristic diffusive length scale. Overall, this work establishes a unified neural-network framework for characterizing nonequilibrium dynamics of representative transport systems.

cond-mat.stat-mech↗

Energy-guided Recursive Model

Recursive models show promise on reasoning and language tasks, yet their test-time scaling lacks a principled criterion for selecting trajectories or determining recurrent depth. We introduce \textbf{Energy-guided Recursive Model (ERM)}, which uses Hopfield-type memories of valid local and global structures to assign intrinsic energies to candidate trajectories. These energies guide candidate selection and suggest an effective range of recurrent depths, implying that deeper recurrence does not necessarily improve reasoning accuracy. They also enable sampling methods such as parallel tempering to improve exploration. For reasoning tasks, ERM achieves optimal solutions on Sudoku ($98.97\%$), Pencil Puzzle Bench (PPBench, $88.04\%$) and Maze ($99.30\%$), reaching the best accuracy in recursive modeling. On language modeling, ERM reduces RedPajama-V2 perplexity by $1.74\%$ with marginal inference overhead. The results support energy guidance as a practical framework for improving test-time scaling in recursive models.

cs.LG↗

Discrete Diffusion Models via Evolving Variational Autoregressive Networks

Conventional score-based diffusion models learn scores without representing normalized densities, whereas tractable normalized models support both sampling and direct likelihood evaluation. A recent tensor-network approach provides such a representation but is largely restricted to low-dimensional lattices. Here we introduce a discrete diffusion model that parameterizes normalized probability distributions using variational autoregressive networks. Explicit Markov jump operators govern the forward noising and reverse denoising dynamics, extending discrete diffusion models with normalized distributions to spin systems on higher-dimensional lattices. We apply this framework to the two- and three-dimensional Ising models across ordered, critical, and disordered regimes, accurately computing thermodynamic quantities including free energy, energy, and magnetization. We further integrate the framework with Monte Carlo sampling, using adaptive diffusion steps to maintain high acceptance rates even at low temperatures while enhancing sample diversity. These results establish a neural-network framework for the discrete diffusion model with normalized probability distributions.

cs.LG↗

Growth from KiDS: Stellar mass assembly of galaxies since z=2 in the light of Kilo-Degree Survey

We measure the galaxy stellar mass function at $z = 0-2$ using 28M galaxies from the KiDS DR4 which spans an effective survey area of 676.9 deg$^2$. Combining nine-band photometry ($u$--$K_s$) and redshifts derived using deep learning photometry, we use five SED fitting configurations, CIGALE/LePhare and CB19/BC03/M05 Stellar Population Synthesis (SPS). We present the impact of the systematics related to the code, SPS modeling and Star formation History (SFH) , which combined can introduce systematics of $\sim 0.6$ dex. The GSMFs outlined in this work agree well with previous studies (within the uncertainties introduced by systematics) that typically are able to cover measurements for the GSMF only up to $\log(M_*/M_\odot)\sim 11.75$, due to their limited volume. The large KiDS area and galaxy counts, allows us to gain some insights on the ``extreme" high-mass end, and our GSMFs imply that possibly there are more massive galaxies than we would expect, from a simple exponential cut-off, at $\log(M_*/M_\odot)>11.75$. However, we heed caution that despite advances done both in redshift estimation techniques and SPS, future studies are required to confirm this behavior. We consider the effects of Eddington-bias (EB) to our observations via two different methods and compare our results with the predictions of semi-analytic models and hydrodynamical simulations. We use the Mean Absolute Difference (MAD) of residuals as a diagnostic metric. Due to inconsistencies ($> 0.5$ dex) between observations and Eddington biased simulations found, especially at the high mass end, we suggest that some theoretical models would achieve better performance once parameter tuning takes into account the effects of EB prior to the tuning of the uncertain parameters involved related to stellar physics and feedback.

astro-ph.GA↗

Universal sampling of spin systems across quenched disorder

Statistical physics extracts macroscopic laws by averaging over the many microscopic degrees of freedom of a system. Disordered systems demand a second and far harder average, one over the quenched randomness itself. The classic analytical routes, the replica and cavity methods, become uncontrolled outside mean-field or tree-like limits, and conventional numerical algorithms like parallel tempering require expensive, independent equilibration for every disorder realization. In this work, we introduce a universal neural variational framework that amortizes inference across the disorder ensemble, eliminating both the need for per-instance Markov chain equilibration and the cost of retraining instance-specific variational ansatzes. Built on an encoder-decoder Transformer architecture, after training once, it produces an explicit approximation to the Boltzmann distribution given previously unseen disorder realizations without further optimization. We validate this framework on 2D Edwards-Anderson models, and apply it to the random-bond Ising model, successfully capturing the Binder cumulant crossings near the Nishimori multicritical point. These results shift the object of variational inference from the single instance to the disorder ensemble, opening a route to frustrated many-body systems where instance-by-instance computation is prohibitive.

cond-mat.stat-mech↗

Black Hole-Galaxy Correlations in Cluster Zoomed-in Simulations: GIZMO-SIMBA and TNG-Cluster

We investigate the co-evolution of supermassive black holes (SMBHs) and central galaxies in massive clusters using the GIZMO-SIMBA and TNG-Cluster zoom-in simulations at $z=0-5$. We find that the distinct subgrid physics of these two models suggest fundamentally different evolutionary pathways. On the one hand, GIZMO-SIMBA, employs torque-limited accretion and predicts a supply-driven scenario where the SMBHs rapidly assemble synchronized with dark matter halo ($M_{200c}$) growth (i.e. the halo mass-BH mass relation is set by $z=3.0$ and similar to the present-day relationship). On the other hand, TNG-Cluster, exhibits a feedback-regulated growth phase delayed by an early thermal suppression. While both models successfully reproduce some local black hole-galaxy scaling relations, they imply significantly different evolution for these relations. Analysis of the BH mass-gas mass ratio relations suggests that TNG-Cluster's isotropic kinetic winds efficiently deplete cold gas, resulting in a "hard quench" of star formation. In the black hole accretion rate (BHAR)-star formation rate (SFR) relation we find that both simulations successfully reproduce the decoupling of BHAR and star formation observed in recent massive cluster ellipticals. The divergent evolutionary trends emphasize the importance of the multiphase intracluster medium; while these subgrid models do not have the necessary resolution and employ distinct formalisms, the sustained BHAR in quenched systems resemble outcomes broadly consistent with modern multiphase feeding paradigms such as chaotic cold accretion in turbulent cluster cores. Furthermore, we demonstrate that for both models, black hole mass is a primary regulator of atomic and molecular gas depletion in galaxy clusters.

astro-ph.GA↗

Response Morphologies of a Canonical Fluctuation Diagnostic Across Ehrenfest Phase Transitions

Microcanonical inflection-point analysis identifies MIPA-type higher-order transition structures from derivatives of the microcanonical entropy. Until recently, however, there was no canonical formulation for probing the corresponding fluctuation-level behavior directly from measurable energy fluctuations without reconstructing the density of states. Previous work addressed this limitation by introducing a canonical fluctuation diagnostic that quantifies energy-fluctuation asymmetry. Here, we investigate how this diagnostic behaves across representative first-, second-, and third-order phase transitions in the Ehrenfest classification. We consider the eight-state Potts model, the two-dimensional Ising model, and ideal three-dimensional Bose--Einstein condensation. The Potts and Ising systems exhibit a robust paired-extremum structure of the diagnostic near their respective transition regions, whereas ideal Bose--Einstein condensation exhibits a discontinuous response at the condensation temperature in the thermodynamic limit. These results show that a single fluctuation-based observable can display qualitatively distinct response morphologies across thermodynamic regimes, reflecting sensitivity to the nature of the underlying phase transition rather than serving as a direct classifier of Ehrenfest order.

cond-mat.stat-mech↗

Kolmogorov-Arnold Reservoir Computing

Reservoir computing offers a lightweight framework for forecasting dynamical systems but may struggle to capture long-range dependencies due to limited representational capacity. Conventional reservoir computing recurrently uses fixed reservoirs with hyperparameter sensitivity, while the next generation reservoir computing removes recurrence at the cost of rapidly growing feature dimensions. Here, we develop Kolmogorov-Arnold Reservoir Computing (KARC), which replaces reservoirs with explicit basis-function expansions inspired by the Kolmogorov-Arnold representation theorem. We rigorously show that KARC is a lightweight design of Kolmogorov-Arnold networks (KANs), preserving the potential expressive capacity of KANs while admitting efficient closed-form training of reservoir computing. At comparable cost, KARC outperforms existing reservoir computing methods on challenging benchmarks including partial differential equations. It can also be integrated with generative diffusion models for facilitating text-to-image generation. This work thus establishes a principled bridge between reservoir computing and KANs, yielding a unified framework for efficient dynamical forecasting and generative modeling.

cs.LG↗

Quantum Flow Matching

The flow matching has rapidly become a dominant paradigm in classical generative modeling, offering an efficient way to interpolate between two complex distributions. We extend this idea to the quantum realm and introduce the Quantum Flow Matching (QFM), a quantum-circuit realization that offers efficient interpolation between two density matrices. QFM offers systematic preparation of density matrices and generation of samples for accurately estimating observables, and can be realized on quantum computers without the need for costly circuit redesigns. We validate its versatility on a set of applications: (i) generating target states with prescribed magnetization and entanglement entropy, (ii) estimating nonequilibrium free-energy differences to test the quantum Jarzynski equality, and (iii) expediting the study on superdiffusion. These results position QFM as a unifying and promising framework for generative modeling across quantum systems.

quant-ph↗

Scalable Physics-Inspired Transformers for Spin Glasses

Efficient sampling of the Boltzmann distribution in frustrated spin glasses is central to statistical mechanics and combinatorial optimization. Despite advances in machine-learning-based approaches, two issues persist: limited understanding of why variational models fail to benefit from increased scale, unlike the monotonic scaling law of large language models; and high computational cost on large systems that negates advantages over classical sampling methods. Here, we develop a physics-inspired transformer with interpretable sparse attention and spin-tailored positional embeddings to address these challenges. By further leveraging FlashAttention for parallel ancestral sampling, it achieves up to two orders of magnitude speedup over vanilla variational autoregressive networks, enabling neural-network simulations of spin-glass systems to unprecedented sizes on a single GPU. It can resolve full probability distributions, free energies, and overlap statistics across temperatures, for Sherrington-Kirkpatrick and 2D or 3D Edwards-Anderson models, where existing machine-learning methods encounter limitations at certain temperatures. This framework thus establishes a scalable paradigm for frustrated spin-glass systems.

cond-mat.dis-nn↗

Irreversibility Enhances Quantum-Enhanced Markov-Chain Monte Carlo

Detailed balance underlies conventional Markov-chain Monte Carlo (MCMC) algorithms. Yet in classical systems, breaking detailed balance generates irreversible probability currents and can accelerate sampling. Whether irreversibility can similarly enhance quantum MCMC remains an intriguing question. Here we show that irreversibility provides a new route to improving the recent quantum-enhanced MCMC (QEMC), which combines quantum proposals with classical acceptance. By introducing state-dependent proposals that break detailed balance while preserving the target stationary distribution, we develop an irreversible quantum-enhanced Monte Carlo (IQEMC). Guided by Landau-Zener transitions, IQEMC promotes large energy descents from high-energy states while maintaining stable transitions near low-energy states. On spin-glass benchmarks, IQEMC outperforms QEMC without increasing computational complexity and, unlike the annealing baseline, exhibits a spectral gap that increases with system size and annealing speed. These results establish irreversibility as a physically grounded mechanism for enhancing quantum MCMC.

cond-mat.stat-mech↗

Dynamical Partition Functions of Stochastic Dynamics via Variational Flows

Nonequilibrium thermodynamics is governed by the dynamical partition function, and its computation in high-dimensional continuous-state dynamics is a longstanding challenge. The Feynman-Kac formalism provides a rigorous representation for generating functions of arbitrary path observables; however, practical evaluation beyond low dimensions or the weak-noise limit is hindered by the curse of dimensionality and the exponentially growing replica demands of trajectory-based methods. Here we develop a mesh-free neural variational framework that realizes the Feynman-Kac theorem with generative flow models, recasting tilted stochastic evolution as a time-dependent optimization problem. This approach enables the direct computation of both finite-time and asymptotic trajectory thermodynamics in a unified manner. The method applies to general observables, enabling the evaluation of work, entropy production, and current fluctuations. We demonstrate the accuracy and scalability of this method in various nonequilibrium systems including high-dimensional cases.

cond-mat.stat-mech↗

PRISM: Synergizing Vision Foundation Models via Self-organized Expert Specialization

Unifying the complementary strengths of diverse Vision Foundation Models (VFMs) into a single efficient model is highly desirable but challenged by the negative transfer inherent in monolithic distillation. To address these feature conflicts, we introduce \textbf{PRISM}, a novel dual-stream Mixture-of-Experts (MoE) framework that synergizes VFMs via modular specialization. We propose a two-stage paradigm: (1) expertise deconstruction, where a teacher-conditional router guides experts to specialize in distinct representational subspaces to mitigate interference, followed by (2) dynamic recomposition, where the router learns to assemble these experts into tailored computational pathways for downstream tasks. Experiments on PASCAL-Context and NYUD-v2 show that \textbf{PRISM} establishes a new state of the art, validating that sparse, emergent specialization is a scalable approach for integrating diverse visual knowledge.

cs.CV↗