new

Get trending papers in your email inbox!

Subscribe

Daily Papers

byAK and the research community

Oct 16

Complete Synchronization and its Transition in Higher Harmonic Sakaguchi--Kuramoto Oscillators

In heterogeneous networks of coupled oscillators, phase frustration typically prevents the emergence of synchronization in the Sakaguchi--Kuramoto (SK) model. In this study, we propose an analytical framework to overcome this barrier and induce complete synchronization at a specified small coupling value in oscillators governed by phase-frustrated bi-harmonic coupling. We derive an optimal set of natural frequencies that is robust against added noise and correlated with the network degree heterogeneity, along with the parameters involved in the bi-harmonic coupling function that lead to complete synchronization (r = 1). In addition, we find complete synchronization transitions accompanied by hysteresis in scale-free networks, indicating a first-order (discontinuous) phase transition, whereas Erdős--Rényi networks exhibit complete synchronization through a second-order (continuous) phase transition. Furthermore, we use the mean-field approximation in the presence of optimal frequencies to determine the critical coupling strength associated with the synchronization transition in the pure second-harmonic Sakaguchi--Kuramoto model. Here, the obtained optimal natural frequencies scale linearly with the node degree, and the critical coupling strength for the onset of synchronization is derived analytically from the self-consistent equations. In this specific regime, we observe a perfectly ordered two-cluster synchronized state. These findings remain robust for higher-order harmonic coupling schemes, as well as across a diverse range of synthetic and empirical networks, including scale-free, Erdős--Rényi, Zachary Karate Club, and the C.~elegans neural network, demonstrating their general applicability.

  • 5 authors
·
May 20

A Benchmark Dataset for Multimodal Prediction of Enzymatic Function Coupling DNA Sequences and Natural Language

Predicting gene function from its DNA sequence is a fundamental challenge in biology. Many deep learning models have been proposed to embed DNA sequences and predict their enzymatic function, leveraging information in public databases linking DNA sequences to an enzymatic function label. However, much of the scientific community's knowledge of biological function is not represented in these categorical labels, and is instead captured in unstructured text descriptions of mechanisms, reactions, and enzyme behavior. These descriptions are often captured alongside DNA sequences in biological databases, albeit in an unstructured manner. Deep learning of models predicting enzymatic function are likely to benefit from incorporating this multi-modal data encoding scientific knowledge of biological function. There is, however, no dataset designed for machine learning algorithms to leverage this multi-modal information. Here we propose a novel dataset and benchmark suite that enables the exploration and development of large multi-modal neural network models on gene DNA sequences and natural language descriptions of gene function. We present baseline performance on benchmarks for both unsupervised and supervised tasks that demonstrate the difficulty of this modeling objective, while demonstrating the potential benefit of incorporating multi-modal data types in function prediction compared to DNA sequences alone. Our dataset is at: https://hoarfrost-lab.github.io/BioTalk/.

  • 6 authors
·
Jul 21, 2024

Functional data decomposition reveals unexpectedly strong soil moisture-precipitation coupling over the Great Plains

Soil moisture-precipitation coupling (SMPC) plays a critical role in Earth's water and energy cycles but remains difficult to quantify due to synoptic-scale variability and the complex interplay of land-atmosphere processes. Here, we apply high-dimensional model representation (HDMR) to functionally decompose the structural, correlative, and cooperative contributions of key land-atmosphere variables to precipitation. Benchmark tests confirm that HDMR overcomes limitations of commonly used correlation and regression approaches in isolating direct versus indirect effects. For example, analysis of gross primary productivity using a light-use-efficiency model shows that linear regression underestimates the temperature effect, while HDMR captures it accurately. Applying HDMR to CONUS404 reanalysis data reveals that morning soil moisture explains up to 40 percent of the variance in summertime afternoon precipitation over the Great Plains, more than double prior estimates. On days with afternoon rainfall (12-hour totals of 4.7-8.2 mm), first-order SM effects can boost precipitation by up to 8 mm under wet conditions, with an additional 3 mm from second-order interactions involving temperature and moisture. By capturing real-world co-variability and higher-order effects, HDMR provides a physically grounded, data-driven framework for diagnosing land-atmosphere coupling. These results underscore the need for more nuanced, interaction-aware data analysis methods in climate modeling and prediction.

  • 4 authors
·
Jun 15, 2025

All You Need is a Good Functional Prior for Bayesian Deep Learning

The Bayesian treatment of neural networks dictates that a prior distribution is specified over their weight and bias parameters. This poses a challenge because modern neural networks are characterized by a large number of parameters, and the choice of these priors has an uncontrolled effect on the induced functional prior, which is the distribution of the functions obtained by sampling the parameters from their prior distribution. We argue that this is a hugely limiting aspect of Bayesian deep learning, and this work tackles this limitation in a practical and effective way. Our proposal is to reason in terms of functional priors, which are easier to elicit, and to "tune" the priors of neural network parameters in a way that they reflect such functional priors. Gaussian processes offer a rigorous framework to define prior distributions over functions, and we propose a novel and robust framework to match their prior with the functional prior of neural networks based on the minimization of their Wasserstein distance. We provide vast experimental evidence that coupling these priors with scalable Markov chain Monte Carlo sampling offers systematically large performance improvements over alternative choices of priors and state-of-the-art approximate Bayesian deep learning approaches. We consider this work a considerable step in the direction of making the long-standing challenge of carrying out a fully Bayesian treatment of neural networks, including convolutional neural networks, a concrete possibility.

  • 4 authors
·
Nov 25, 2020

Anomaly-mediated Scalar Gravitational Interactions and the Coupling of Conformal Sectors

We investigate the anomaly-induced activation of a gauge-invariant scalar degree of freedom in General Relativity, the conformalon mode, directly at the level of \(2\to2\) scattering amplitudes. The analysis couples anomalous three-point functions of conformal sectors, involving gravitons \((TTT)\) and Abelian gauge currents \((TJJ)\), through single-graviton exchange derived from the quadratic expansion of the Einstein--Hilbert action. Unlike related treatments based on the nonlocal anomaly action, these interactions are suppressed by the Planck scale. We show that the conformalon, invariant under linearized diffeomorphisms, admits an interpretation as an effective scalar correction to scattering amplitudes, both in virtual exchange channels and in effective real-emission processes. Around flat space, this behaviour arises from anomaly-induced nonlocal massless insertions on the external graviton and photon legs of the three-point functions, sewn through the scalar component of the graviton propagator in de Donder gauge. The resulting anomaly-mediated \(4\)-point interaction reduces to contact terms, with the Planck mass setting the suppression scale. The construction consistently matches the spin decomposition of flat-space conformal Ward identities in momentum space, which determine the vertices, with the corresponding spin decomposition of the graviton propagator. In the eikonal limit, these interactions generate contact corrections to the leading logarithmic phase in impact-parameter space. We further show that anomaly-mediated \(2\to2\) graviton amplitudes associated with the virtual exchange of such modes exhibit a characteristic double-copy structure.

  • 4 authors
·
Mar 31

DriveAdapter: Breaking the Coupling Barrier of Perception and Planning in End-to-End Autonomous Driving

End-to-end autonomous driving aims to build a fully differentiable system that takes raw sensor data as inputs and directly outputs the planned trajectory or control signals of the ego vehicle. State-of-the-art methods usually follow the `Teacher-Student' paradigm. The Teacher model uses privileged information (ground-truth states of surrounding agents and map elements) to learn the driving strategy. The student model only has access to raw sensor data and conducts behavior cloning on the data collected by the teacher model. By eliminating the noise of the perception part during planning learning, state-of-the-art works could achieve better performance with significantly less data compared to those coupled ones. However, under the current Teacher-Student paradigm, the student model still needs to learn a planning head from scratch, which could be challenging due to the redundant and noisy nature of raw sensor inputs and the casual confusion issue of behavior cloning. In this work, we aim to explore the possibility of directly adopting the strong teacher model to conduct planning while letting the student model focus more on the perception part. We find that even equipped with a SOTA perception model, directly letting the student model learn the required inputs of the teacher model leads to poor driving performance, which comes from the large distribution gap between predicted privileged inputs and the ground-truth. To this end, we propose DriveAdapter, which employs adapters with the feature alignment objective function between the student (perception) and teacher (planning) modules. Additionally, since the pure learning-based teacher model itself is imperfect and occasionally breaks safety rules, we propose a method of action-guided feature learning with a mask for those imperfect teacher features to further inject the priors of hand-crafted rules into the learning process.

  • 6 authors
·
Aug 1, 2023

Implicit Actor Critic Coupling via a Supervised Learning Framework for RLVR

Recent advances in Reinforcement Learning with Verifiable Rewards (RLVR) have empowered large language models (LLMs) to tackle challenging reasoning tasks such as mathematics and programming. RLVR leverages verifiable outcome rewards to guide policy optimization, enabling LLMs to progressively improve output quality in a grounded and reliable manner. Despite its promise, the RLVR paradigm poses significant challenges, as existing methods often suffer from sparse reward signals and unstable policy gradient updates, particularly in RL-based approaches. To address the challenges, we propose PACS, a novel RLVR framework that achieves imPlicit Actor Critic coupling via a Supervised learning framework. By treating the outcome reward as a predictable label, we reformulate the RLVR problem into a supervised learning task over a score function parameterized by the policy model and optimized using cross-entropy loss. A detailed gradient analysis shows that this supervised formulation inherently recovers the classical policy gradient update while implicitly coupling actor and critic roles, yielding more stable and efficient training. Benchmarking on challenging mathematical reasoning tasks, PACS outperforms strong RLVR baselines, such as PPO and GRPO, achieving superior reasoning performance. For instance, PACS achieves 59.78\% at pass@256 on AIME 2025, representing improvements of 13.32 and 14.36 points over PPO and GRPO. This simple yet powerful framework offers a promising avenue for LLMs post-training with verifiable rewards. Our code and data are available as open source at https://github.com/ritzz-ai/PACS.

  • 8 authors
·
Sep 2, 2025 6

Minimum Entropy Coupling with Bottleneck

This paper investigates a novel lossy compression framework operating under logarithmic loss, designed to handle situations where the reconstruction distribution diverges from the source distribution. This framework is especially relevant for applications that require joint compression and retrieval, and in scenarios involving distributional shifts due to processing. We show that the proposed formulation extends the classical minimum entropy coupling framework by integrating a bottleneck, allowing for a controlled degree of stochasticity in the coupling. We explore the decomposition of the Minimum Entropy Coupling with Bottleneck (MEC-B) into two distinct optimization problems: Entropy-Bounded Information Maximization (EBIM) for the encoder, and Minimum Entropy Coupling (MEC) for the decoder. Through extensive analysis, we provide a greedy algorithm for EBIM with guaranteed performance, and characterize the optimal solution near functional mappings, yielding significant theoretical insights into the structural complexity of this problem. Furthermore, we illustrate the practical application of MEC-B through experiments in Markov Coding Games (MCGs) under rate limits. These games simulate a communication scenario within a Markov Decision Process, where an agent must transmit a compressed message from a sender to a receiver through its actions. Our experiments highlight the trade-offs between MDP rewards and receiver accuracy across various compression rates, showcasing the efficacy of our method compared to conventional compression baseline.

  • 3 authors
·
Oct 28, 2024 2

Massive On-shell Splitting Functions in Spinor-Helicity Formalism

Collinear splitting functions govern parton evolution, parton showers, and resummation at high-energy colliders. While on-shell spinor-helicity methods have successfully yielded massless QCD splitting functions, a complete on-shell construction for massive particles, systematically incorporating finite-mass effects, is less developed. We present an on-shell constructive formalism for massive collinear splitting functions based on Soper-Weinberg collinear spinors, whose transformation properties follow from a light-front Galilean subgroup of the Poincaré group. Decomposing massive momenta and spinors with respect to fixed lightlike vectors n and bar n makes the expansion in the alignment regime m<p_Tll p_+ manifest. The leading-order structures are matched to massless three-point amplitudes, while an additional Higgs momentum along bar n probes the subleading spinor components and relates them to massless four-point amplitudes. We derive the complete set of leading and subleading massive splitting functions for all Standard Model particles and establish a systematic matching dictionary between massless and massive coupling coefficients at both the three- and four-point levels. Higher-point splitting functions are obtained through the recursive bootstrap relation with a universal substitution rule as a consequence of the Galilean symmetry. This constructive framework extends naturally to effective field theory operators and higher perturbative orders, providing a flexible computational tool for precision collider physics and parton shower development.

  • 3 authors
·
Jul 22

Constrained Bi-Level Optimization: Proximal Lagrangian Value function Approach and Hessian-free Algorithm

This paper presents a new approach and algorithm for solving a class of constrained Bi-Level Optimization (BLO) problems in which the lower-level problem involves constraints coupling both upper-level and lower-level variables. Such problems have recently gained significant attention due to their broad applicability in machine learning. However, conventional gradient-based methods unavoidably rely on computationally intensive calculations related to the Hessian matrix. To address this challenge, we begin by devising a smooth proximal Lagrangian value function to handle the constrained lower-level problem. Utilizing this construct, we introduce a single-level reformulation for constrained BLOs that transforms the original BLO problem into an equivalent optimization problem with smooth constraints. Enabled by this reformulation, we develop a Hessian-free gradient-based algorithm-termed proximal Lagrangian Value function-based Hessian-free Bi-level Algorithm (LV-HBA)-that is straightforward to implement in a single loop manner. Consequently, LV-HBA is especially well-suited for machine learning applications. Furthermore, we offer non-asymptotic convergence analysis for LV-HBA, eliminating the need for traditional strong convexity assumptions for the lower-level problem while also being capable of accommodating non-singleton scenarios. Empirical results substantiate the algorithm's superior practical performance.

  • 4 authors
·
Jan 29, 2024

"Theater of Mind" for LLMs: A Cognitive Architecture Based on Global Workspace Theory

Modern Large Language Models (LLMs) operate fundamentally as Bounded-Input Bounded-Output (BIBO) systems. They remain in a passive state until explicitly prompted, computing localized responses without intrinsic temporal continuity. While effective for isolated tasks, this reactive paradigm presents a critical bottleneck for engineering autonomous artificial intelligence. Current multi-agent frameworks attempt to distribute cognitive load but frequently rely on static memory pools and passive message passing, which inevitably leads to cognitive stagnation and homogeneous deadlocks during extended execution. To address this structural limitation, we propose Global Workspace Agents (GWA), a cognitive architecture inspired by Global Workspace Theory. GWA transitions multi-agent coordination from a passive data structure to an active, event-driven discrete dynamical system. By coupling a central broadcast hub with a heterogeneous swarm of functionally constrained agents, the system maintains a continuous cognitive cycle. Furthermore, we introduce an entropy-based intrinsic drive mechanism that mathematically quantifies semantic diversity, dynamically regulating generation temperature to autonomously break reasoning deadlocks. Coupled with a dual-layer memory bifurcation strategy to ensure long-term cognitive continuity, GWA provides a robust, reproducible engineering framework for sustained, self-directed LLM agency.

  • 1 authors
·
Apr 8

Reflect-R1: Evidence-Driven Reflection for Self-Correction in Long Video Understanding

Current multimodal reflection mechanisms for long video understanding predominantly rely on closed-loop self-reflection within internal parameters. Lacking objective external evidence, models are frequently trapped in blind confidence and often fail to correct errors. Furthermore, applying reinforcement learning to multi-stage reflection pipelines introduces severe policy coupling, which is exacerbated by a critical scarcity of dedicated training data. To address these limitations, this work proposes Reflect-R1, the first Evidence-Driven self-correction framework for long video understanding. The framework constructs a three-stage pipeline consisting of intuition, verification, and arbitration. By dynamically retrieving objective visual evidence to verify initial intuitions and autonomously executing multiple temporal searches to resolve conflicts, it completely breaks the hallucination loop. To overcome policy coupling, we design a stage-decoupled reinforcement learning algorithm named SD-GRPO that independently computes advantage functions across different reasoning stages. Concurrently, we construct a dataset of 120K samples to bridge the training data gap. Extensive experiments on benchmarks such as VideoMME and LongVideoBench demonstrate that Reflect-R1 achieves state-of-the-art performance. Our method significantly improves the genuine rectification rate and enables authentic self-correction strictly grounded in objective evidence.

  • 10 authors
·
Jun 25

CP2K: An electronic structure and molecular dynamics software package - Dynamics, Transport, and Spectroscopic Response

One of the distinguishing aspects of CP2K is its seamless integration of diverse structural and transition-state optimization techniques with advanced sampling approaches including Monte Carlo, molecular dynamics, and metadynamics, enabling the efficient exploration of complex potential- and free-energy landscapes, including rare events. These capabilities are combined with a broad hierarchy of energy and force evaluation methods, ranging from classical and machine-learned interaction potentials and mixed quantum-classical multiscale and semiempirical schemes, to highly accurate quantum-mechanical electronic-structure approaches. At the heart of the latter lies the Gaussian and plane-wave framework, along with its augmented all-electron generalization, which have been described in detail in our previous code review [T. D. Kühne et al., J. Chem. Phys. 152, 194103 (2020)]. Building on this foundation, the present work revisits the methods within CP2K that turn electronic structure into dynamics, transport, and spectroscopic response. Particular emphasis is placed on the coupling between static response calculations and nuclear motion: spectra may be evaluated at optimized structures, averaged over thermally sampled configurations, obtained from time-correlation functions along ab-initio or path integral molecular trajectories, or followed in real time together with electronic and nuclear dynamics. The same modular structure also enables equilibrium and biased transport simulations, from Kubo-type linear response to open-boundary approaches under external potentials, highlighting CP2K's unique capability to unify quantum chemistry with quantum and statistical mechanics within a versatile, holistic simulation environment.

  • 42 authors
·
Jul 30

BIRD-INTERACT: Re-imagining Text-to-SQL Evaluation for Large Language Models via Lens of Dynamic Interactions

Large language models (LLMs) have demonstrated remarkable performance on single-turn text-to-SQL tasks, but real-world database applications predominantly require multi-turn interactions to handle ambiguous queries, execution errors, and evolving user requirements. Existing multi-turn benchmarks fall short by treating conversation histories as static context or limiting evaluation to read-only operations, failing to reflect production-grade database assistant challenges. We introduce BIRD-INTERACT, a benchmark that restores this realism through: (1) a comprehensive interaction environment coupling each database with a hierarchical knowledge base, metadata files, and a function-driven user simulator, enabling models to solicit clarifications, retrieve knowledge, and recover from errors without human supervision; (2) two evaluation settings consisting of a pre-defined conversational protocol (c-Interact) and an open-ended agentic setting (a-Interact) where models autonomously decide when to query the user simulator or explore the environment; (3) a challenging task suite covering the full CRUD spectrum for business-intelligence and operational use cases, guarded by executable test cases. Each task features ambiguous and follow-up sub-tasks requiring dynamic interaction. The suite comprises BIRD-INTERACT-FULL (600 tasks, up to 11,796 interactions) for comprehensive performance assessment, and BIRD-INTERACT-LITE (300 tasks with simplified databases) for detailed behavioral analysis and rapid method development. Our empirical results highlight BIRD-INTERACT's difficulty: GPT-5 completes only 8.67% of tasks in c-Interact and 17.00% in a-Interact. Analysis via memory grafting and Interaction Test-time Scaling validates the importance of effective interaction for complex, dynamic text-to-SQL tasks.

birdsql The BIRD Team
·
Oct 6, 2025 2

Mela: Test-Time Memory Consolidation based on Transformation Hypothesis

Memory consolidation, the process by which transient experiences are transformed into stable, structured representations, is a foundational organizing principle in the human brain, yet it remains largely unexplored as a design principle for modern sequence models. In this work, we leverage established neuroscientific theories of memory consolidation and cross-frequency coupling to propose the Hierarchical Memory Module (HMM), a neural memory architecture composed of two functionally distinct sub-modules that operate at different update frequencies. Inspired by the transformation hypothesis, the low-frequency sub-module produces high-level representations that capture abstract, gist-level knowledge, while the high-frequency sub-module produces fine-grained representations that preserve richer episodic detail. The final memory output is dynamically reconstructed as a context-dependent combination of both representations, analogous to the reconstructive nature of human memory retrieval. We integrate HMM into a Transformer-based language decoder to form Mela, a family of memory-augmented language models that perform online memory consolidation at test time. To further exploit the multi-granularity memory representations produced by HMM, we introduce MemStack, a method that distributes different levels of memory features across the early layers of the decoder without introducing additional tokens. Experiments on language modeling demonstrate that Mela outperforms Transformer baselines across all the model sizes. Moreover, with the pretrained context length fixed at 4K, Mela maintains performance on significantly longer contexts, whereas Transformer baselines degrade rapidly beyond their training length. Extensive ablation studies validate the contribution of each component and provide guidance for practical configuration.

MusubiAI Musubi
·
May 10 1

RoverDevKit: An open, physics-grounded tradespace toolkit for conceptual design of lunar micro-rovers

Pre-Phase-A design of lunar micro-rovers is dominated by tightly coupled mobility, power, thermal, and mass trades, yet conceptual-design tooling for the rapidly growing sub-50 kg class is typically proprietary, weakly benchmarked, or too slow to drive optimization. We contribute RoverDevKit, an open analytical evaluator coupling terramechanics, mass, power, thermal survival, and traverse that runs in 30ms per mission, fast enough to serve directly as a multi-objective optimizer's fitness function. Across mare, polar, highland, and crater-rim scenarios, NSGA-II Pareto fronts show that the binding design trade changes with mission profile within a single mass class: energy storage dominates at high latitude, slope traction on loose highland regolith, and traverse range on mare and crater-rim missions. Notably, rigid four-wheel layouts Pareto-dominate the full modeled mass range under smooth-regolith range-mass-slope objectives, contrary to the expectation that six-wheel architectures become optimal at heavier masses; six-wheel rocker-bogie layouts enter the Pareto set only once missions impose an obstacle-navigation requirement. The evaluator performance is benchmarked using both component and system checks: the terramechanics kernel matches measured single-wheel drawbar pull within the literature model-form band on two independent datasets, the bottom-up mass model predicts published in-class (5-50 kg) rover masses to 13.3% median absolute error, and a rediscovery check places real micro-rovers near the optimizer's fronts. Propagating the measured terramechanics error through the optimizer leaves the qualitative design rules unchanged. The tool, data, validation artifacts, and figure-generation scripts are released openly.

  • 1 authors
·
Jun 18

DeeperBrain: A Neuro-Grounded EEG Foundation Model Towards Universal BCI

Electroencephalography (EEG) foundation models hold significant promise for universal Brain-Computer Interfaces (BCIs). However, existing approaches often rely on end-to-end fine-tuning and exhibit limited efficacy under frozen-probing protocols, lacking the intrinsic universality required for broad generalization. This limitation stems from adapting general-purpose sequence architectures that overlook the biophysical and dynamical principles of neural activity. To bridge this gap, we propose DeeperBrain, a neuro-grounded foundation model integrating domain-specific inductive biases into its model design and learning objectives. Architecturally, DeeperBrain incorporates a volume conduction-aware channel encoding to model spatial mixing via 3D geometry, and a neurodynamics-aware temporal encoding capturing slow adaptations using oscillatory and exponential bases. For pretraining, we introduce a dual-objective strategy combining Masked EEG Reconstruction (MER) for local fidelity and Neurodynamics Statistics Prediction (NSP). NSP enforces alignment with macroscopic brain states by predicting interpretable order parameters, including spectral power, functional connectivity, cross-frequency coupling, and dynamic complexity. Extensive experiments demonstrate that DeeperBrain achieves state-of-the-art or highly competitive performance under end-to-end fine-tuning. Crucially, it maintains superior efficacy under a rigorous frozen-probing protocol, verifying that embedding neuroscientific first principles endows learned representations with the intrinsic universality essential for universal BCI. The code will be publicly available.

  • 6 authors
·
Jan 5

First-principles predictions of Hall and drift mobilities in semiconductors

Significant progress on parameter-free calculations of carrier mobilities in real materials has been made during the past decade; however, the role of various approximations remains unclear and a unified methodology is lacking. Here, we present and analyse a comprehensive and efficient approach to compute the intrinsic, phonon-limited drift and Hall carrier mobilities of semiconductors, within the framework of the first-principles Boltzmann transport equation. The methodology exploits a novel approach for estimating quadrupole tensors and including them in the electron-phonon interactions, and capitalises on a rigorous and efficient procedure for numerical convergence. The accuracy reached in this work allows to assess common approximations, including the role of exchange and correlation functionals, spin-orbit coupling, pseudopotentials, Wannier interpolation, Brillouin-zone sampling, dipole and quadrupole corrections, and the relaxation-time approximation. A detailed analysis is showcased on ten prototypical semiconductors, namely diamond, silicon, GaAs, 3C-SiC, AlP, GaP, c-BN, AlAs, AlSb, and SrO. By comparing this extensive dataset with available experimental data, we explore the intrinsic nature of phonon-limited carrier transport and magnetotransport phenomena in these compounds. We find that the most accurate calculations predict Hall mobilities up to a factor of two larger than experimental data; this could point to promising experimental improvements in the samples quality, or to the limitations of density-function theory in predicting the carrier effective masses and overscreening the electron-phonon matrix elements. By setting tight standards for reliability and reproducibility, the present work aims to facilitate validation and verification of data and software towards predictive calculations of transport phenomena in semiconductors.

  • 6 authors
·
May 9, 2021

Transition from decaying to decayless kink oscillations of solar coronal loops

The transition of an impulsively excited kink oscillation of a solar coronal loop to an oscillation with a stationary amplitude, i.e., the damping pattern, is determined using the low-dimensional self-oscillation model. In the model, the decayless kink oscillations are sustained by the interaction of the oscillating loop with an external quasi-steady flow. The analytical solution is based on the assumption that the combined effect of the effective dissipation, for example, by resonant absorption, and interaction with an external flow, is weak. The effect is characterised by a dimensionless coupling parameter. The damping pattern is found to depend upon the initial amplitude and the coupling parameter. The approximate expression shows a good agreement with a numerical solution of the self-oscillation equation. The plausibility of the established damping pattern is demonstrated by an observational example. Notably, the damping pattern is not exponential, and the characteristic decay time is different from the time determined by the traditionally used exponential damping fit. Implications of this finding for seismology of the solar coronal plasmas are discussed. In particular, it is suggested that a very rapid, in less than the oscillation period, decay of the oscillation to the stationary level, achieved for larger values of the coupling parameter, can explain the relative rareness of the kink oscillation events.

  • 3 authors
·
Jun 10, 2024

Fourth-order perturbation theory for the Frohlich polaron: Analytic structure of the weak-coupling series and the crossover to strong coupling

We calculate the Rayleigh-Schrodinger perturbation series for the ground-state energy and the effective mass of the three-dimensional Frohlich polaron through fourth order in the coupling constant alpha. The third- and fourth-order coefficients of the effective mass are new. Because the Frohlich interaction is a form-bounded perturbation of an isolated nondegenerate ground state at fixed total momentum, the series has a nonzero radius of convergence, and we analyze it with the ratio and Pade methods appropriate to convergent series. The coefficients are strikingly regular and are described by a simple power-law singularity at alpha near 8.5 with an exponent near 1.4. The couplings at which successive truncations of the inverse mass vanish, the first of which is the textbook breakdown value alpha = 6, are slowly converging estimates of this radius. Pade approximants built from the weak-coupling coefficients alone agree with diagrammatic Monte Carlo results for the mass to better than one percent for alpha up to 5. Exact results on the analyticity of the ground state and on the strong-coupling asymptotics imply that the coefficients cannot keep a constant sign, although all known coefficients do, so that the apparent singularity must be a complex-conjugate pair close to the positive real axis. It marks the crossover to strong coupling: the weak-coupling series locates this crossover accurately but cannot be continued through it.

  • 1 authors
·
Oct 6

Mean Field Theory Based on the Spike Time Response Curve for Synchronization Within and Between Two Alternating Populations of Neural Oscillators with Delays

In order to study oscillators coupled by pulses emitted at discrete times, it is generally assumed that the effect of each pulse is an instantaneous phase shift, with a possible conduction delay between emission and receipt. However, we are interested in neural oscillators in which each pulse (action potential) activates a biexponential synapse, and at high frequencies, the duration of the synaptic conductance may be greater than the network period. Therefore, the effect of received pulses can summate over the course of several cycles. To overcome this limitation, we previously defined a mean field approach for a single synchronous population. Here, we extend it to two alternating synchronous populations by assuming a perturbation of a single oscillator from one of the synchronous populations which is represented by a single self-connected neural oscillator. The train of delayed biexponential synapses emitted by each oscillator is divided into a tonic and a phasic component. Because of the continuous rather than pulsatile nature of the input, we had to drop the concept of oscillator phase and derive self-consistent criteria for the existence and stability of an alternating firing pattern between two synchronous populations based solely on the perturbation of time intervals from their steady state values. Simulations showed that for high frequency oscillations as defined above, the mean field approach predicts the existence and stability of phase-locking between two synchronous populations better than the instantaneous phase shift approach. This approach may generalize to other forms of coupling amongst non-neural oscillators.

  • 2 authors
·
Oct 6

Linear equivalence of nonlinear recurrent neural networks

Large nonlinear recurrent neural networks with random couplings generate high-dimensional, potentially chaotic activity whose structure is of interest in neuroscience and other fields. A fundamental object encoding the collective structure of this activity is the N times N covariance matrix. Prior analytical work on the covariance matrix has been limited to low-dimensional summary statistics. Recent work proposed an ansatz in which, at large N, the covariance matrix for a typical quenched realization takes the same form as that of a linear network with the same couplings, driven by independent noise, with DMFT order parameters setting the transfer function and the noise spectrum. Here, we derive this ansatz using the two-site cavity method, providing two derivations with complementary perspectives. The first decomposes each unit's activity into a linear response to its local field and a nonlinear residual, and shows that cross-covariances between residuals at distinct sites are strongly suppressed, so the residuals act as independent noise driving a linear network. The second derives a self-consistent matrix equation for the covariance matrix. A naive Gaussian closure for the joint statistics of local fields at distinct sites misses cross terms that, in a linear network, would be generated by an external drive. The cavity method recovers these terms from non-Gaussian contributions, revealing an emergent external drive. Higher-order cross-site moments follow a Wick-like decomposition into products of pairwise covariances at leading order, reducing them to the linear-equivalent form. We verify the predictions in simulations. These results extend linear equivalence from feedforward high-dimensional nonlinear systems, where the activations are independent of the weights, to recurrent networks, where the activations are correlated with the couplings that generate them.

  • 1 authors
·
May 4

Semigroup Solutions for A Multilayered Filtration System

We investigate solutions to a coupled system of partial differential equations that describe a multilayered filtration system. Namely, we study the interaction of a viscous incompressible flow with bulk poroelasticity, via a poroelastic interface. The configuration consists of two 3D toroidal subdomains connected via a plate interface, which permits elastic deformation and perfusive fluid dynamics. The governing dynamics comprise Stokes equations in the bulk fluid region, Biot's equations in the bulk poroelastic region, and the recent poroplate of Mikelić at the interface. Coupling occurs on the top and lower surfaces of the plate, and involves conservation of mass, stress balance, and a certain slip condition for the fluid free-flow. We seek strong (and mild) solutions in the Hilbert space framework via the Lumer-Phillips theorem. The resolvent analysis employs a nonstandard mixed variational formulation which captures the complex, multi-physics coupling at the interface. We explicitly characterize the infinitesimal generator associated to the linear Cauchy problem and establish the generation of a C_0-semigroup on a suitably chosen finite-energy space. With the semigroup in hand, we may treat elastic nonlinearities for plate displacements through perturbation theory. These result parallel those for Biot-Stokes filtration systems, and complement the recently established weak solution theory for multilayer filtrations. The agency of the semigroup straightforwardly admits structural (plate) nonlinearity into the dynamics. Future stability and regularity analyses for multilayer filtrations are also made possible by these results, as well as a comparison of spectral and regularity properties between filtration configurations, and the elucidation of the mitigating poroplate dynamics as possibly regularizing and stabilizing.

  • 3 authors
·
Jan 31

anyakrakusuma: A Python Library for Entropic Schrödinger Bridges on Idealized Geometries

We present anyakrakusuma, an open-source Python library that solves the discrete static Schrödinger bridge problem, the entropically regularized counterpart of optimal transport, through a log-domain Sinkhorn--Knopp iteration and reconstructs the entropic interpolation between two empirical point clouds. The solver is paired with a diagnostic pipeline that characterizes the optimal coupling and the intermediate distributions through information-theoretic and geometric measures. We exercise the library on four idealized planar cases spanning a circle-to-circle dilation, a spiral-to-mixture fragmentation, a rigid reorientation of two moons, and a Lissajous-to-trefoil deformation. The log-domain formulation is necessary rather than merely convenient at the parameters studied, where the cost-to-regularization ratio reaches four hundred and the Gibbs kernel underflows double precision across most of its range; the iteration nonetheless attains a marginal residual of 10^{-9} and unit marginal fidelity in every case. Residual histories decay geometrically over approximately eight decades at per-iteration contraction factors between 0.966 and 0.976, which are local rates near the fixed point that lie many orders of magnitude below the worst-case Hilbert-metric bound. The covariance analysis recovers an imposed ninety-degree reorientation to within 0.07^circ, roughly forty times smaller than its uncertainty, across a masked interval of near-isotropy on which the principal axis is unobservable. The diagnostics are reported with explicit attention to the regimes in which each is well defined, including the differential entropy, which is meaningful only on the open interpolation interval. The presented cases are constructed rather than measured; quantitative application to empirical point clouds requires further study.

Synchronization and Redundancy: Implications for Robustness of Neural Learning and Decision Making

Learning and decision making in the brain are key processes critical to survival, and yet are processes implemented by non-ideal biological building blocks which can impose significant error. We explore quantitatively how the brain might cope with this inherent source of error by taking advantage of two ubiquitous mechanisms, redundancy and synchronization. In particular we consider a neural process whose goal is to learn a decision function by implementing a nonlinear gradient dynamics. The dynamics, however, are assumed to be corrupted by perturbations modeling the error which might be incurred due to limitations of the biology, intrinsic neuronal noise, and imperfect measurements. We show that error, and the associated uncertainty surrounding a learned solution, can be controlled in large part by trading off synchronization strength among multiple redundant neural systems against the noise amplitude. The impact of the coupling between such redundant systems is quantified by the spectrum of the network Laplacian, and we discuss the role of network topology in synchronization and in reducing the effect of noise. A range of situations in which the mechanisms we model arise in brain science are discussed, and we draw attention to experimental evidence suggesting that cortical circuits capable of implementing the computations of interest here can be found on several scales. Finally, simulations comparing theoretical bounds to the relevant empirical quantities show that the theoretical estimates we derive can be tight.

  • 2 authors
·
Oct 21, 2010

Scaling Online Optimal Transport Minibatches for Flow Matching

A central challenge in scaling flow models is maintaining stability in training and integration. In flow matching, this stability depends critically on how source samples are paired with data. Independent random pairing introduces substantial stochasticity, motivating minibatch optimal transport (OT) to construct online source-target couplings that reduce this randomness (Tong et al., 2024). However, as applications extend to larger and higher-dimensional datasets, small minibatches can limit these benefits, while scaling the coupling to substantially larger minibatches at every iteration is computationally prohibitive. Moreover, how OT coupling affects the full stochastic gradient and integration remains theoretically unresolved. In this work, we develop a scalable online entropic OT approximation that enables substantially larger source-target couplings while preserving the benefits of OT. We close the theoretical gap for both unregularized and entropic OT by proving strict reductions in full stochastic-gradient variance and integration error relative to independent pairing, and further characterize how these improvements strengthen as the online coupling minibatch grows. Experiments on single-cell gene interpolation-flow and image-flow training validate these predictions, showing that larger online couplings consistently improve training stability and final generation performance.

A Decoupled Basis-Vector-Driven Generative Framework for Dynamic Multi-Objective Optimization

Dynamic multi-objective optimization requires continuous tracking of moving Pareto fronts. Existing methods struggle with irregular mutations and data sparsity, primarily facing three challenges: the non-linear coupling of dynamic modes, negative transfer from outdated historical data, and the cold-start problem during environmental switches. To address these issues, this paper proposes a decoupled basis-vector-driven generative framework (DB-GEN). First, to resolve non-linear coupling, the framework employs the discrete wavelet transform to separate evolutionary trajectories into low-frequency trends and high-frequency details. Second, to mitigate negative transfer, it learns transferable basis vectors via sparse dictionary learning rather than directly memorizing historical instances. Recomposing these bases under a topology-aware contrastive constraint constructs a structured latent manifold. Finally, to overcome the cold-start problem, a surrogate-assisted search paradigm samples initial populations from this manifold. Pre-trained on 120 million solutions, DB-GEN performs direct online inference without retraining or fine-tuning. This zero-shot generation process executes in milliseconds, requiring approximately 0.2 seconds per environmental change. Experimental results demonstrate that DB-GEN improves tracking accuracy across various dynamic benchmarks compared to existing algorithms.

  • 5 authors
·
Mar 31

Inverse Bayesian Inference for Extracting Lesion Dynamics from Longitudinal Spectral CT

Longitudinal medical imaging captures temporal evolution of lesions, yet extracting the underlying dynamical parameters governing this evolution remains challenging. We propose an inverse Bayesian framework for inferring lesion dynamics from longitudinal spectral CT. We decompose spectral feature (x) evolution into three components: equation* dx_i{dt} = A_i x_i + B \cdot n + C \cdot Δx_{sat} equation* where A_i captures intrinsic dynamics (lesion-autonomous evolution), B captures local environment tumour burden (organ tumour burden through satellite count coupling), and C captures environment/satellite state change (i.e., whether surrounding lesions move similarly or not). We demonstrate the framework on photon-counting NSCLC CT data from metastases, recovering distinct dynamical regimes: lung lesions exhibit significant satellite count coupling (B=-0.34, p<0.05) suggesting competitive dynamics, while liver lesions show synergistic satellite behaviour coupling (Capprox+1.0, p<0.05). Synthetic validation confirms parameter recovery, and cross-coupling analysis validates that our method detects non-zero coupling when present. This work establishes inverse dynamical inference as a principled methodology for extracting interpretable parameters from longitudinal imaging, moving beyond static feature extraction toward mechanistic characterisation of lesion behaviour. The code and data are available at: https://github.com/lukasf98/inverse-bayesian-inference

  • 9 authors
·
Jul 24

Dynamical phase diagram of synchronization in one dimension: universal behavior from Edwards-Wilkinson to random deposition through Kardar-Parisi-Zhang

Synchronization in one dimension displays generic scale invariance with universal properties previously observed in surface kinetic roughening and the wider context of the Kardar-Parisi-Zhang (KPZ) universality class. This has been established for phase oscillators and also for some limit-cycle oscillators, both in the presence of columnar (quenched) disorder and of time-dependent noise, by extensive numerical simulations, and has been analytically motivated by continuum approximations in the strong oscillator coupling limit. The robustness and the precise boundaries in parameter space for such critical behavior remain unclear, however, which may preclude further developments, including the extension of these results to higher dimensions and the experimental observation of nonequilibrium criticality in synchronizing (e.g.~electronic or chemical) oscillators. We here present complete numerical phase diagrams of one-dimensional synchronization, including saturation times and values, but, most importantly, also dynamical features giving insight into the gradual emergence of synchronous dynamics, based on systems of phase oscillators with either type of randomness. In the absence of synchronization, the dynamics evolves as expected for random deposition (for time-dependent noise) or linear growth (for columnar disorder), while a crossover from Edwards-Wilkinson to Kardar-Parisi-Zhang behavior (with the corresponding type of randomness) is observed as the randomness strength, or the nonoddity of the coupling among oscillators, is increased in the synchronous region -- their combined effect being partially captured by the so-called KPZ coupling. The distortion of scaling due to phase slips near the desynchronization boundary, a feature that is likely to play a role in experimental contexts, is also discussed.

  • 2 authors
·
Apr 6

SNIC bifurcation and its Application to MEMS

This project focuses on a method to extract a frequency comb in mechanical means, for general interest and numerous practical applications in MEMS. The method of execution is the implementation of a beam that is exhibiting non-linear dynamics that is perturbed and analyzed for its transverse vibrations. The perturbation is an external harmonic driver with a chosen small amplitude and frequency (which is slightly detuned from the beam eigenfrequency), that when engaged with the unperturbed beam oscillations, causes it reach a state of "injection pulling" - an effect that occurs when one harmonic oscillator is coupled with a second one and causes it to oscillate in a frequency near its own. This causes the beam to reach SNIC bifurcation, rendering a frequency comb as desired. Theoretical analysis showed that the problem can be modelled using a non-linear equation of the beam, that translates to a form of the non-linear Duffing equation. While a solution to the dynamics function of the beam is hard to obtain in practice due to mathematical difficulties, a slow evolution model is suggested that is composed of functions of a amplitude and phase. Using several additional mathematical assumptions, the amplitude is seen to be related to the phase, while the phase equation solution is seen to be of the form of Adler's equation. These assumptions ultimately reduce the entire behaviour of the beam to a relatively simple solution to the Adler equation, which has a known analytical solution. Computerized numerical simulations are run on it to check the results and compare them to the theory and desired outcome. The results agreed with the theory and produce the expected frequency comb, showing the assumptions to be valid in extracting the comb.

  • 1 authors
·
Aug 24, 2025

Counterfactual Generation via Flow Matching: Coupling-Sensitive End-to-End Rates

Counterfactual generation seeks to sample outcomes under a hypothetical intervention or decision using observational data collected under the factual assignment mechanism. We develop a flow-matching approach that combines a sample-split, doubly robust training objective with a learned coupling between observed source outcomes and target outcomes drawn from a fitted conditional outcome model. To enable finite-step generation, we leverage a score-corrected stochastic sampler based on a Gaussian-smoothed interpolation. Our main theoretical contribution is a coupling-sensitive KL bound for constant-step Euler discretization: the error is controlled by moments of the source--target displacement under the chosen coupling, rather than by global uniform regularity of the velocity field, and has near-linear dependence on the ambient dimension. We also establish finite-sample non-parametric guarantees for the learned velocity and score fields when both the conditional outcome model and the source-target coupling are estimated from data. These bounds separate approximation, coupling-replacement, nuisance-estimation, generalization, and Monte Carlo errors and, combined with the sampler analysis, yield an end-to-end guarantee for counterfactual generation. Experiments on synthetic and semi-synthetic image benchmarks support the coupling-dependent theory and show that, at finite discretization budgets, the stochastic sampler can outperform the corresponding deterministic ODE sampler.

  • 3 authors
·
Sep 30

When Network Architecture Meets Physics: Deep Operator Learning for Coupled Multiphysics

Scientific applications increasingly demand real-time surrogate models that can capture the behavior of strongly coupled multiphysics systems driven by multiple input functions, such as in thermo-mechanical and electro-thermal processes. While neural operator frameworks, such as Deep Operator Networks (DeepONets), have shown considerable success in single-physics settings, their extension to multiphysics problems remains poorly understood. In particular, the challenge of learning nonlinear interactions between tightly coupled physical fields has received little systematic attention. This study addresses a foundational question: should the architectural design of a neural operator reflect the strength of physical coupling it aims to model? To answer this, we present the first comprehensive, architecture-aware evaluation of DeepONet variants across three regimes: single-physics, weakly coupled, and strongly coupled multiphysics systems. We consider a reaction-diffusion equation with dual spatial inputs, a nonlinear thermo-electrical problem with bidirectional coupling through temperature-dependent conductivity, and a viscoplastic thermo-mechanical model of steel solidification governed by transient phase-driven interactions. Two operator-learning frameworks, the classical DeepONet and its sequential GRU-based extension, S-DeepONet, are benchmarked using both single-branch and multi-branch (MIONet-style) architectures. Our results demonstrate that architectural alignment with physical coupling is crucial: single-branch networks significantly outperform multi-branch counterparts in strongly coupled settings, whereas multi-branch encodings offer advantages for decoupled or single-physics problems. Once trained, these surrogates achieve full-field predictions up to 1.8e4 times faster than high-fidelity finite-element solvers, without compromising solution accuracy.

  • 6 authors
·
Jul 3, 2025

A Topological and Operator Algebraic Framework for Asynchronous Lattice Dynamical Systems

I introduce a novel mathematical framework integrating topological dynamics, operator algebras, and ergodic geometry to study lattices of asynchronous metric dynamical systems. Each node in the lattice carries an internal flow represented by a one-parameter family of operators, evolving on its own time scale. I formalize stratified state spaces capturing multiple levels of synchronized behavior, define an asynchronous evolution metric that quantifies phase-offset distances between subsystems, and characterize emergent coherent topologies arising when subsystems synchronize. Within this framework, I develop formal operators for the evolution of each subsystem and give precise conditions under which phase-aligned synchronization occurs across the lattice. The main results include: (1) the existence and uniqueness of coherent (synchronized) states under a contractive coupling condition, (2) stability of these coherent states and criteria for their emergence as a collective phase transition in a continuous operator topology, and (3) the influence of symmetries, with group-invariant coupling leading to flow-invariant synchrony subspaces and structured cluster dynamics. Proofs are given for each theorem, demonstrating full mathematical rigor. In a final section, I discuss hypothetical applications of this framework to symbolic lattice systems (e.g. subshifts), to invariant group actions on dynamical lattices, and to operator fields over stratified manifolds in the spirit of noncommutative geometry. Throughout, I write in the first person to emphasize the exploratory nature of this work. The paper avoids any reference to cosmology or observers, focusing instead on clean, formal mathematics suitable for a broad array of dynamical systems.

  • 1 authors
·
May 14, 2025

Langevin Flows for Modeling Neural Latent Dynamics

Neural populations exhibit latent dynamical structures that drive time-evolving spiking activities, motivating the search for models that capture both intrinsic network dynamics and external unobserved influences. In this work, we introduce LangevinFlow, a sequential Variational Auto-Encoder where the time evolution of latent variables is governed by the underdamped Langevin equation. Our approach incorporates physical priors -- such as inertia, damping, a learned potential function, and stochastic forces -- to represent both autonomous and non-autonomous processes in neural systems. Crucially, the potential function is parameterized as a network of locally coupled oscillators, biasing the model toward oscillatory and flow-like behaviors observed in biological neural populations. Our model features a recurrent encoder, a one-layer Transformer decoder, and Langevin dynamics in the latent space. Empirically, our method outperforms state-of-the-art baselines on synthetic neural populations generated by a Lorenz attractor, closely matching ground-truth firing rates. On the Neural Latents Benchmark (NLB), the model achieves superior held-out neuron likelihoods (bits per spike) and forward prediction accuracy across four challenging datasets. It also matches or surpasses alternative methods in decoding behavioral metrics such as hand velocity. Overall, this work introduces a flexible, physics-inspired, high-performing framework for modeling complex neural population dynamics and their unobserved influences.

  • 5 authors
·
Jul 15, 2025

What Shape is the Inflationary Bispectrum?

Non-linear interactions during inflation generate non-Gaussianities in the distribution of primordial curvature. In many theories, the physics is scale-invariant, such that the induced three-point function depends solely on a dimensionless shape function S(x,y)sim k^6B_ζ(kx,ky,k). To confront such models with observations, one typically builds specialized estimators for each shape, then applies them to cosmic microwave background datasets at significant computational expense. In this Letter, we take a different approach, directly reconstructing S(x,y) from observations using an efficient logarithmically-binned estimator in primordial-space (motivated by the modal program). Applying this to temperature and polarization maps from Planck, we obtain high-resolution shape measurements across the full (x,y)-plane, including squeezed limits. Our approach is close-to-optimal, highly interpretable, and preserves the information content on (optimally-analyzed) standard templates within approx 10%; moreover, we can use it to assess the scale-dependence of our constraints, finding that Planck is sensitive to approx 6 e-folds of non-Gaussian evolution with a peak sensitivity around 0.1h,Mpc^{-1}. Since we work directly in shape-space, data and theory can be compared in milliseconds. As an example, we perform a search for massive particle exchange using a suite of over 20,000 theoretical templates computed with exact bootstrap methods (for the first time) across a wide range of masses, spins, and sound-speeds; the spin-two analysis yields a maximum significance of 2.6σ. Our approach can be used to probe a wide range of scale-invariant models in orders-of-magnitude less time than with direct estimators, allowing the inflationary paradigm to be explored in new ways.

  • 1 authors
·
Mar 25

DRIFT-Net: A Spectral--Coupled Neural Operator for PDEs Learning

Learning PDE dynamics with neural solvers can significantly improve wall-clock efficiency and accuracy compared with classical numerical solvers. In recent years, foundation models for PDEs have largely adopted multi-scale windowed self-attention, with the scOT backbone in Poseidon serving as a representative example. However, because of their locality, truly globally consistent spectral coupling can only be propagated gradually through deep stacking and window shifting. This weakens global coupling and leads to error accumulation and drift during closed-loop rollouts. To address this, we propose DRIFT-Net. It employs a dual-branch design comprising a spectral branch and an image branch. The spectral branch is responsible for capturing global, large-scale low-frequency information, whereas the image branch focuses on local details and nonstationary structures. Specifically, we first perform controlled, lightweight mixing within the low-frequency range. Then we fuse the spectral and image paths at each layer via bandwise weighting, which avoids the width inflation and training instability caused by naive concatenation. The fused result is transformed back into the spatial domain and added to the image branch, thereby preserving both global structure and high-frequency details across scales. Compared with strong attention-based baselines, DRIFT-Net achieves lower error and higher throughput with fewer parameters under identical training settings and budget. On Navier--Stokes benchmarks, the relative L_{1} error is reduced by 7\%--54\%, the parameter count decreases by about 15\%, and the throughput remains higher than scOT. Ablation studies and theoretical analyses further demonstrate the stability and effectiveness of this design. The code is available at https://github.com/cruiseresearchgroup/DRIFT-Net.

Equilibrium Propagation: Bridging the Gap Between Energy-Based Models and Backpropagation

We introduce Equilibrium Propagation, a learning framework for energy-based models. It involves only one kind of neural computation, performed in both the first phase (when the prediction is made) and the second phase of training (after the target or prediction error is revealed). Although this algorithm computes the gradient of an objective function just like Backpropagation, it does not need a special computation or circuit for the second phase, where errors are implicitly propagated. Equilibrium Propagation shares similarities with Contrastive Hebbian Learning and Contrastive Divergence while solving the theoretical issues of both algorithms: our algorithm computes the gradient of a well defined objective function. Because the objective function is defined in terms of local perturbations, the second phase of Equilibrium Propagation corresponds to only nudging the prediction (fixed point, or stationary distribution) towards a configuration that reduces prediction error. In the case of a recurrent multi-layer supervised network, the output units are slightly nudged towards their target in the second phase, and the perturbation introduced at the output layer propagates backward in the hidden layers. We show that the signal 'back-propagated' during this second phase corresponds to the propagation of error derivatives and encodes the gradient of the objective function, when the synaptic update corresponds to a standard form of spike-timing dependent plasticity. This work makes it more plausible that a mechanism similar to Backpropagation could be implemented by brains, since leaky integrator neural computation performs both inference and error back-propagation in our model. The only local difference between the two phases is whether synaptic changes are allowed or not.

  • 2 authors
·
Mar 27, 2017

Surface defects in N=4 Super Yang-Mills: exact results and holographic bootstrap

We study two-point functions of chiral primary operators in N=4 Super Yang-Mills in the presence of a half-BPS surface defect. Such a defect preserves only the diagonal combination of transverse rotations and of a global U(1) R-symmetry, so that the correlator depends on one additional cross-ratio and splits into sectors of definite angular charge. We solve the superconformal Ward identities and construct the bulk and defect superconformal blocks in all sectors, including the charged ones, which have no analogue for defects preserving transverse rotations. The solution contains a holomorphic sector, which we fix non-perturbatively by mapping it to a chiral algebra correlator. We extend this map to defects breaking transverse rotations, where it requires a redefinition of the modes of the two-dimensional current algebra, and use it to fix the charged sectors as well. We then use the defect dispersion relation to reconstruct the full correlator of the dimension-two chiral primary at leading order at large N and strong coupling. In the charged sectors long multiplets are absent and the answer is conjecturally exact in both N and the coupling; expanding it at weak coupling, we find perfect agreement with known results. From these correlators we extract infinitely many new pieces of defect CFT data. Finally, we reproduce the strong-coupling answer by an independent Witten diagram bootstrap on the rotation-invariant locus.

  • 4 authors
·
Oct 6

Linear statistics for Coulomb gases: higher order cumulants

We consider N classical particles interacting via the Coulomb potential in spatial dimension d and in the presence of an external trap, at equilibrium at inverse temperature beta. In the large N limit, the particles are confined within a droplet of finite size. We study smooth linear statistics, i.e. the fluctuations of sums of the form {cal L}_N = sum_{i=1}^N f({bf x}_i), where {bf x}_i's are the positions of the particles and where f({bf x}_i) is a sufficiently regular function. There exists at present standard results for the first and second moments of {cal L}_N in the large N limit, as well as associated Central Limit Theorems in general dimension and for a wide class of confining potentials. Here we obtain explicit expressions for the higher order cumulants of {cal L}_N at large N, when the function f({bf x})=f(|{bf x}|) and the confining potential are both rotationnally invariant. A remarkable feature of our results is that these higher cumulants depend only on the value of f'(|{bf x}|) and its higher order derivatives evaluated exactly at the boundary of the droplet, which in this case is a d-dimensional sphere. In the particular two-dimensional case d=2 at the special value beta=2, a connection to the Ginibre ensemble allows us to derive these results in an alternative way using the tools of determinantal point processes. Finally we also obtain the large deviation form of the full probability distribution function of {cal L}_N.

  • 4 authors
·
Oct 25, 2023

Metastable Cosmological Constant and Gravitational Bubbles: Ultra-Late-Time Transitions in Modified Gravity

The observed cosmological constant may originate as the minimum value U_{min} of a scalar field potential, where the scalar field is frozen due to a large mass. If this vacuum is metastable, it may decay to a true vacuum either at present or in the future. Assuming its decay rate Gamma is comparable to the Hubble expansion rate H_0, we estimate the scale of true vacuum bubbles and analyze their evolution. We find that their initial formation scale is sub-millimeter and their tension causes rapid collapse if m gtrsim 1.7 cdot 10^{-3}, eV. For smaller masses, the bubbles expand at the speed of light. We extend our analysis to scalar-tensor theories with non-minimal coupling, finding that the nucleation scale of gravitational constant bubbles remains consistent with the sub-millimeter regime of General Relativity. The critical mass scale remains around 10^{-3},eV. A theoretical estimate at redshift z_{obs} sim 0.01 suggests an observable bubble radius of sim 50 Mpc, implying a gravitational transition triggered sim 300 Myr ago, with a present-day size approaching 100 Mpc. Additionally, we explore mass ranges (m < 10^{-3},eV) and non-minimal coupling xi ranges (10^{-8},eV^{2-n} - 10^{-1},eV^{2-n}) that lead to a variation Delta G/G_N within the 1%-7% range. We assume non-minimal coupling of the form F(phi)=1/kappa - xi phi^n, with kappa=8pi G_N and 2 leq n leq 9. Finally, we review various local physics or/and transition based proposed solutions to the Hubble tension, including ultra-late-time transitional models (z sim 0.01), screened fifth-force mechanisms, and the Lambda_{rm s}CDM model, which features a transition at z sim 2. We discuss observational hints supporting these scenarios and the theoretical challenges they face.

  • 2 authors
·
Mar 14, 2025

Probing the Black Hole Singularity with a Quantum String

In this paper, we investigate the quantum behaviour near the classical singularity of a black hole. We describe the black-hole interior by the Kantowski-Sachs metric, with a string propagating in this region. This approach is motivated by the fact that, near the classical singularity, spacetime curvature reaches Planck or string scales, necessitating a description in terms of string-theoretic degrees of freedom. The string dynamics is formulated via the Polyakov action, and the combined system is canonically quantized to derive the corresponding Wheeler-DeWitt equation. Although the equation is separable in the radial and azimuthal string sectors, the remaining geometric and string degrees of freedom are nontrivially coupled. To address this, we employ a perturbative approach and obtain the wave function up to first order. At the zeroth-order, the angular part is described by the general Heun function, while the geometric part is expressed in terms of the Bessel function. The first-order wave function is governed by a source term containing the zeroth-order solution, and we obtain its explicit expression in terms of the complementary function and the particular integral. We confirm regularity of the wave function at both zeroth and first order, at the singularity as well as at the horizon. Regularity at the horizon imposes a discretization condition on one eigenvalue, while another eigenvalue is quantized due to the azimuthal periodicity of the wave function. Importantly, both zeroth- and first-order solutions satisfy the DeWitt boundary condition, implying resolution of the black hole singularity within this quantum framework.

  • 2 authors
·
Oct 6

Multiphysics Bench: Benchmarking and Investigating Scientific Machine Learning for Multiphysics PDEs

Solving partial differential equations (PDEs) with machine learning has recently attracted great attention, as PDEs are fundamental tools for modeling real-world systems that range from fundamental physical science to advanced engineering disciplines. Most real-world physical systems across various disciplines are actually involved in multiple coupled physical fields rather than a single field. However, previous machine learning studies mainly focused on solving single-field problems, but overlooked the importance and characteristics of multiphysics problems in real world. Multiphysics PDEs typically entail multiple strongly coupled variables, thereby introducing additional complexity and challenges, such as inter-field coupling. Both benchmarking and solving multiphysics problems with machine learning remain largely unexamined. To identify and address the emerging challenges in multiphysics problems, we mainly made three contributions in this work. First, we collect the first general multiphysics dataset, the Multiphysics Bench, that focuses on multiphysics PDE solving with machine learning. Multiphysics Bench is also the most comprehensive PDE dataset to date, featuring the broadest range of coupling types, the greatest diversity of PDE formulations, and the largest dataset scale. Second, we conduct the first systematic investigation on multiple representative learning-based PDE solvers, such as PINNs, FNO, DeepONet, and DiffusionPDE solvers, on multiphysics problems. Unfortunately, naively applying these existing solvers usually show very poor performance for solving multiphysics. Third, through extensive experiments and discussions, we report multiple insights and a bag of useful tricks for solving multiphysics with machine learning, motivating future directions in the study and simulation of complex, coupled physical systems.

  • 5 authors
·
May 23, 2025

Clustering of higher order connected correlations in C^* dynamical systems

In the context of C^* dynamical systems, we consider a locally compact group G acting by ^*-automorphisms on a C^* algebra U of observables, and assume a state of U that satisfies the clustering property with respect to a net of group elements of G. That is, the two-point connected correlation function vanishes in the limit on the net, when one observable is translated under the group action. Then we show that all higher order connected correlation functions (Ursell functions, or classical cumulants) and all free correlation functions (free cumulants, from free probability) vanish at the same rate in that limit. Additionally, we show that mean clustering, also called ergodicity, extends to higher order correlations. We then apply those results to equilibrium states of quantum spin lattice models. Under certain assumptions on the range of the interaction, high temperature Gibbs states are known to be exponentially clustering w.r.t. space translations. Combined with the Lieb-Robinson bound, one obtains exponential clustering for space-time translations outside the Lieb-Robinson light-cone. Therefore, by our present results, all the higher order connected and free correlation functions will vanish exponentially under space-time translations outside the Lieb-Robinson light cone, in high temperature Gibbs states. Another consequence is that their long-time averaging over a space-time ray vanishes for almost every ray velocity.

  • 2 authors
·
Aug 1, 2024

On-shell renormalization of sine-Gordon by the quantum inverse scattering method

In the quantum inverse scattering method, the sine-Gordon model is solved on a lattice, and its continuum and infinite-volume limits become uniform only after the length of the box is rescaled. We show that this rescaling, supplemented by an on-shell condition, defines a renormalization scheme. The whole dependence on the cut-off is absorbed into a factor Z_L multiplying the length of the box, with an exponent fixed by the scaling dimension of the vertex operator; neither the field nor the coupling β is renormalized, no subtraction scale is introduced, and the mass parameter receives a finite renormalization, fixed by requiring that the lightest breather has the mass of the boson in the linearized theory. The soliton and breather masses follow from the eigenvalues of the monodromy operator as functions of parameters that do not run, and reduce to the classical and semiclassical results as βrightarrow0. In particular, the mass ratios are produced directly from the regularized construction, while the relation between the lattice parameters and the physical scale is absorbed into Z_L and never needs to be computed. The scheme is a reparameterization of the theory which makes explicit the interplay between integrability and renormalization. We compare it with Coleman's normal ordering and with conformal perturbation theory, and we argue that it extends to ultralocal integrable theories with a massive spectrum, possibly including asymptotically free models that admit an ultralocal lattice regularization.

  • 2 authors
·
Sep 30

Tidal Response Beyond the Background Geometry in Einstein-Euler-Heisenberg Black Holes

We determine the quadrupolar logarithmic tidal response of electrically charged Einstein-Euler-Heisenberg black holes from the coupled static odd-parity gravitational and electromagnetic equations. Although the second electromagnetic invariant vanishes on the electric background, its quadratic interaction contributes to the axial fluctuation equations. At first order in the Euler-Heisenberg coupling a, a direct asymptotic recursion gives the canonical running matrix C_{rm can}^{rm EH}=(9aQ^2/10)left(smallmatrix0&-Q-Q&Msmallmatrixright), defined as the coefficients multiplying the canonical source vector in the r^{-2}log(r_0/r) term. The resulting local coefficients retain the full dependence on the subextremal ratio Q{M} at this perturbative order. The two quartic invariants partially cancel in both nonzero channels, while the action-normalized fields make gravitoelectromagnetic reciprocity explicit. The local extremal limit of the running matrix reproduces the corresponding two-invariant effective-field-theory result after convention conversion. Allowing independent quartic couplings further shows that identical electric background geometries can have different axial running matrices and yields algebraic inverse relations within the specified two-operator model. The calculation determines local logarithmic running within minimally coupled quartic electrodynamics; the finite horizon-matched response requires an additional global matching calculation.

  • 5 authors
·
Oct 9

Solving High Frequency and Multi-Scale PDEs with Gaussian Processes

Machine learning based solvers have garnered much attention in physical simulation and scientific computing, with a prominent example, physics-informed neural networks (PINNs). However, PINNs often struggle to solve high-frequency and multi-scale PDEs, which can be due to spectral bias during neural network training. To address this problem, we resort to the Gaussian process (GP) framework. To flexibly capture the dominant frequencies, we model the power spectrum of the PDE solution with a student t mixture or Gaussian mixture. We apply the inverse Fourier transform to obtain the covariance function (by Wiener-Khinchin theorem). The covariance derived from the Gaussian mixture spectrum corresponds to the known spectral mixture kernel. Next, we estimate the mixture weights in the log domain, which we show is equivalent to placing a Jeffreys prior. It automatically induces sparsity, prunes excessive frequencies, and adjusts the remaining toward the ground truth. Third, to enable efficient and scalable computation on massive collocation points, which are critical to capture high frequencies, we place the collocation points on a grid, and multiply our covariance function at each input dimension. We use the GP conditional mean to predict the solution and its derivatives so as to fit the boundary condition and the equation itself. As a result, we can derive a Kronecker product structure in the covariance matrix. We use Kronecker product properties and multilinear algebra to promote computational efficiency and scalability, without low-rank approximations. We show the advantage of our method in systematic experiments. The code is released at https://github.com/xuangu-fang/Gaussian-Process-Slover-for-High-Freq-PDE.

  • 6 authors
·
Nov 8, 2023

Dynamical Dark Energy from a Massive Vector Field in Generalized Proca Theory

In this paper, we emphasise the recent observational findings from the Dark Energy Spectroscopic Instrument Data Release 2 (DESI DR2), which provide compelling evidence for a possible deviation from the standard ΛCDM (Cold Dark Matter) cosmology, suggesting the presence of a dynamically evolving effective dark energy component. Motivated by this, we construct a theoretical framework in which a massive cosmological vector field, B^μ, couples non-minimally to the background curvature through marginal interactions, offering a controlled mechanism to realise the deviation from the ΛCDM model. A detailed analysis of the effective Equation of State (EoS) parameter w(tilde H) reveals a narrow region of parameter space consistent with current cosmological observations presented by DESI. The analysis yields a stringent upper bound for the coupling constant λ to be λ<2.98times10^{-11}, a very strong bound on mass 3.1356times10^{-66}~g leq m leq 3.3627times10^{-66}~g, and the admissible range -0.405 leq log_{10}tildeγleq -0.38 for which present-day value w_0 = w(tilde H = 1) corresponding to a deviation δ= w_0 + 1 that lies within the region 0.107 leq δleq 0.217. This interval reproduces the deviation inferred from the combined DESI, Cosmic Microwave Background (CMB), and Pantheon+ data, reflecting a controlled departure from the ΛCDM behaviour. In summary, the results suggest that the proposed framework of a massive vector field can account for the departure from ΛCDM behaviour highlighted by DESI in the current cosmic acceleration. Furthermore, the framework approaches the ΛCDM behaviour in late-time tgtrsim28 Gyr, establishing a direct phenomenological link between the underlying parameters and the observed dynamical nature of dark energy.

  • 1 authors
·
Nov 3, 2025

Canonical Cortical Field Theories

We characterise the dynamics of neuronal activity, in terms of field theory, using neural units placed on a 2D-lattice modelling the cortical surface. The electrical activity of neuronal units was analysed with the aim of deriving a neural field model with a simple functional form that still able to predict or reproduce empirical findings. Each neural unit was modelled using a neural mass and the accompanying field theory was derived in the continuum limit. The field theory comprised coupled (real) Klein-Gordon fields, where predictions of the model fall within the range of experimental findings. These predictions included the frequency spectrum of electric activity measured from the cortex, which was derived using an equipartition of energy over eigenfunctions of the neural fields. Moreover, the neural field model was invariant, within a set of parameters, to the dynamical system used to model each neuronal mass. Specifically, topologically equivalent dynamical systems resulted in the same neural field model when connected in a lattice; indicating that the fields derived could be read as a canonical cortical field theory. We specifically investigated non-dispersive fields that provide a structure for the coding (or representation) of afferent information. Further elaboration of the ensuing neural field theory, including the effect of dispersive forces, could be of importance in the understanding of the cortical processing of information.

  • 3 authors
·
Aug 20, 2023

WorldKernel: A World Model is the Coupling Kernel of Admissible Possible Worlds

A common assumption holds that enough observational and interventional data, given to a strong enough predictor, suffices. We report a failure mode that contradicts it. Across hundreds of structural causal models, on identified quantities a strong predictor and a Bayesian baseline both succeed, but on unidentified quantities (the couplings between counterfactual worlds) the predictor collapses to a point, on 28% of models to one no valid model can produce, while the truth is an admissible interval more data never narrows. The gap is structural: prediction cannot represent uncertainty over counterfactual couplings. We cast a world model as a single positive semidefinite coupling kernel K(T,T') over admissible worlds, whose diagonal is the ordinary posterior (what a predictor recovers) and whose off-diagonal is the cross-world coupling it cannot, which every counterfactual reads. The paper is the theory of that off-diagonal. It is real: two states with identical posteriors differ on a cross-world query, and the off-diagonal is the coupling that fixes counterfactuals. It can be bounded: positive semidefiniteness is partial-identifying information the marginals lack, and enforcing it bounds counterfactuals in polynomial time where the exact response-type program is intractable. Logical structure sharpens it: ontology axioms tighten the bound by up to a third, propagating to couplings they never touch. It can be acquired: targeted scars, constraints learned from encountered infeasibilities, close the gap several times faster than untargeted ones. Its full reconstruction is approximate counting of the admissible worlds, tractable below the Sly-Sun threshold and inapproximable above; we do not claim to beat the worst case.

  • 1 authors
·
Jun 8