Study reduces complexity and uncertainty in human atrial cell models.
problem Uncertainty in parameter estimates from gating kinetics models.
method Approximate Bayesian computation to re-calibrate models, investigate two approaches: more complete datasets and less complex formulations.
result Less complex model with fewer parameters gives better fit and lower uncertainty.
RC flow learns molecular kinetics in low dimensions.
problem Discovering interpretable low-dimensional models of molecular kinetics.
method Normalizing flow for coordinate transformation and Brownian dynamics for kinetics approximation.
result Tractable and trainable model of reduced kinetics in continuous time and space.
The paper extends Vlasov kinetic theory to time-dependent dynamics using cosymplectic and cocontact manifolds.
problem Extending Vlasov kinetic theory to time-dependent dynamics.
method Introducing geometric kinetic theories within cosymplectic and cocontact manifolds.
result Alternative realizations of cosymplectic and cocontact kinetic theories linked via Poisson/momentum maps.
This research proposes the econophysics kinetic market model as an evolutionary algorithm's instance. The immediate results from this proposal is a new replacement rule for family competition genetic algorithms. It also represents a starting point to adding evolvable entities to kinetic market models.
In this article, we briefly review the different aspects and applications of kinetic exchange models in economics and sociology. Our main aim is to show in what manner the kinetic exchange models for closed economic systems were inspired by the kinetic theory of gas molecules. The simple yet powerful framework of kinet…
New method trains deep neural networks for non-interacting kinetic-energy functionals in DFT.
problem Lack of exact relationship between electron density and non-interacting kinetic energy.
method Variational principle to regularize machine-learned density functionals.
result Excellent results on kinetic-energy functionals for various systems.
Paper proposes a smart neck-band for detecting neck postures using integrated kinematic and kinetic data.
problem Improper neck postures lead to musculoskeletal disorders requiring therapy and rehabilitation.
method Integrated use of kinematic and kinetic data with machine learning algorithms.
result 100% accuracy in predicting neck postures using the proposed platform.
New method uses machine learning to analyze catalyst reactions.
problem Understanding complex reaction mechanisms in catalytic materials.
method Combining transient kinetics and machine learning.
result Correct estimates of micro-kinetic coefficients and mechanism.
We briefly review results on nonlinear kinetic equation of Boltzmann type which describe the evolution of wealth in a simple agents market. The mathematical structure of the underlying kinetic equations allows to use well-known techniques of wide use in kinetic theory of rarefied gases to obtain information on the proc…
Study explores how wealth dynamics change with preferential interactions in kinetic exchange models.
problem Investigate how preferential interactions affect wealth dynamics and distributions in kinetic exchange models.
method Conducted Monte Carlo simulations to explore two types of preferential interactions: one with random selection and another with wealth difference constraint.
result Emergence of quasi-oligarchic societies and segregation into economic classes observed in preferential interactions.
LSS learns molecular trajectories from MD data.
problem Limited integration time steps in MD simulations.
method Three deep learning networks for slow collective variables, dynamics, and configuration reconstruction.
result Generates ultra-long synthetic folding trajectories.
Automated method creates compact chemical models from detailed ones, reducing complexity and improving accuracy.
problem Creating accurate low-dimensional chemical kinetic models from detailed ones is time-consuming and requires expert knowledge.
method Machine Learned Optimisation of Chemical Kinetics (MLOCK) algorithm systematically perturbs sub-models to find optimal compact models.
result Compact models (15 species) retain ~87% fidelity to detailed models, outperforming previous methods.
Exact solution found for two-body financial dealer model using kinetic theory.
problem Finding an exact solution for the two-body financial dealer model.
method Exact master-Liouville equations derived using kinetic theory and probability currents.
result Exact order-book profile and average transaction interval derived.
Improved KLMC for sampling under various conditions.
problem Stable simulation of kinetic Langevin dynamics under different parameters.
method Revisited synchronous Wasserstein coupling analysis with stochastic exponential Euler discretization.
result Exponential integrator can simulate kinetic Langevin dynamics in the overdamped regime with proper time acceleration.
We study a minimalist kinetic model for economies. A system of agents with local trading rules display emergent demand behaviour. We examine the resulting wealth distribution to look for non-thermal behaviour. We compare and contrast this model with other similar models.
Study on kinetic Langevin diffusions and their couplings, showing subtle TV bounds and new non-Markovian couplings.
problem Understanding and quantifying the TV distance between solutions of kinetic Langevin diffusions with different initial values.
method Established new non-Markovian couplings for kinetic Langevin diffusions, derived from optimal coalescence trajectories, and analyzed their TV bounds.
result No Markovian coupling can capture the asymptotic decay rate of the TV distance between solutions of kinetic Langevin diffusions with different initial values.
Learning kinetic systems from data is one of the core challenges in many fields. Identifying stable models is essential for the generalization capabilities of data-driven inference. We introduce a computationally efficient framework, called CausalKinetiX, that identifies structure from discrete time, noisy observations…
Bayesian inference over admissible histories leads to irreversible kinetics.
problem Modeling irreversible processes in systems with uncertain histories.
method A Gibbs-type measure weighted by energy-dissipation action and observation constraints, interpreted as a Bayesian posterior.
result The measure concentrates on maximum-a-posteriori (MAP) histories, recovering classical deterministic evolution.
In this paper, we consider a simple kinetic model of economy involving both exchanges between agents and speculative trading. We show that the kinetic model admits non trivial quasi-stationary states with power law tails of Pareto type. In order to do this we consider a suitable asymptotic limit of the model yielding a…
The paper studies 4-qubit Clifford states and their properties.
problem Understanding the set and properties of 4-qubit Clifford states.
method Analyzing the 293760 4-qubit Clifford states, splitting them into 18 groups, and studying the action of CNOT gates and local gates.
result There are 293760 4-qubit Clifford states with specific entanglement entropies, and any pair can be connected with local gates and at most 3 CNOT gates.
Improved logistic MoE with sigmoid gate shows better sample efficiency.
problem Improving sample efficiency in logistic MoE models.
method Comprehensive analysis of multinomial logistic MoE with modified sigmoid gate, incorporating temperature parameter and using Euclidean score.
result The sigmoid gate leads to lower sample complexity than softmax gate for both parameter and expert estimation.
New method prepares 3-qubit states using local gates and controlled-Z gates.
problem Preparation of 3-qubit states using quantum gates.
method Uses Ry(θ) gates and controlled-Z gates, with an optimal number of controlled-Z gates. result Optimal number of controlled-Z gates for preparing 3-qubit states is four. This paper optimizes paths for generative models using kinetic energy.
problem Improving generative model performance and sample quality.
method Investigating and optimizing Gaussian probability paths with kinetic energy.
result Kinetic optimal Gaussian paths simplify particle trajectories and improve model performance.
We derive a diffusion approximation for the kinetic Vlasov-Fokker-Planck equation in bounded spatial domains with specular reflection type boundary conditions. The method of proof involves the construction of a particular class of test functions to be chosen in the weak formulation of the kinetic model. This involves t…
Kinetic exchange models have been successful in explaining the shape of the income/wealth distribution in the economies. However, such models usually make some ad-hoc assumptions when it comes to determining the savings factor. Here, we examine a few models in and out of the domain of standard neo-classical economics t…
Stochastic approach improves neural network training for kinetic simulations.
problem Training neural networks under physical constraints in kinetic fusion simulations.
method Stochastic augmented Lagrangian approach using pyTorch.
result Higher model prediction accuracy achieved compared to fixed penalty method.
Sigmoid gating is more sample efficient than softmax in mixture of experts.
problem Softmax gating leads to unnecessary competition among experts, causing representation collapse.
method Theoretical analysis of a regression framework with mixture of experts, identifying identifiability conditions and convergence rates.
result Sigmoid gating requires fewer samples to achieve the same expert estimation error as softmax gating.
There is an increasing demand for computing the relevant structures, equilibria and long-timescale kinetics of biomolecular processes, such as protein-drug binding, from high-throughput molecular dynamics simulations. Current methods employ transformation of simulated coordinates into structural features, dimension red…
Compact models for methane/air combustion reduce complexity without sacrificing accuracy.
problem Creating accurate, computationally efficient models for methane combustion.
method Data-oriented three-step methodology: 1) Remove non-essential species, 2) Numerically optimize to key species profiles, 3) Machine learning to refine parameters.
result Produced 19 and 15 species compact models that outperform current state-of-the-art models in accuracy and range of conditions.
In quantum computation, series of quantum gates have to be arranged in a predefined sequence that led to a quantum circuit in order to solve a particular problem. What if the sequence of quantum gates is known but both the problem to be solved and the outcome of the so defined quantum circuit remain in the shadow? This…
The use of kinetic modelling based on partial differential equations for the dynamics of stock price formation in financial markets is briefly reviewed. The importance of behavioral aspects in market booms and crashes and the role of agents' heterogeneity in emerging power laws for price distributions is emphasized and…
Paper proposes new Langevin samplers for sampling from log-concave distributions with superlinear gradient growth.
problem Sampling from log-concave distributions with superlinear gradient growth.
method Proposes two novel discretizations of kinetic Langevin SDEs, showing contractivity and log-Sobolev inequality.
result Establishes non-asymptotic bounds in 2-Wasserstein distance between sampled distributions and target measures.
Long Short-Term Memory (LSTM) infers the long term dependency through a cell state maintained by the input and the forget gate structures, which models a gate output as a value in [0,1] through a sigmoid function. However, due to the graduality of the sigmoid function, the sigmoid gate is not flexible in representing m…
New proof shows nonholonomic motions are geodesics, minimizing distance.
problem Nonholonomic motion equations are not variational.
method Proved geodesic property of nonholonomic trajectories using Riemannian metrics.
result Nonholonomic motions minimize distance in their manifold.
We introduce and analyze a linear kinetic model that describes the evolution of the probability density of the number of firms in a society, in which the microscopic rate of change obeys to the so-called law of proportional effect proposed by Gibrat. Despite its apparent simplicity, the possible mean field limits of th…
A fast method learns plasma collision kernels from simulations, improving kinetic models.
problem Improving kinetic models for plasma dynamics beyond the weakly coupled regime.
method Data-driven collisional operator, fast spectral separation method.
result Accurately captures plasma dynamics in moderately coupled regime.
Gated attention improves model curvature, enhancing performance on nonlinear tasks.
problem Understanding the geometric implications of gating in attention mechanisms.
method Modeling attention outputs as Gaussian distributions and analyzing Fisher--Rao geometry.
result Gated attention enables non-flat geometries, including positively curved manifolds.
Smooth isotopy on cube saves energy with extra dimensions.
problem Constructing an isotopy with infinite kinetic energy.
method Explicit construction of isotopy on [0,1]n. result Existence of isotopy with infinite kinetic energy.
Analysis of Vlasov plasma dynamics using matched pair Lie-Poisson formulation.
problem Understanding the dynamics of Vlasov plasma and its kinetic moments.
method Hamiltonian (Lie-Poisson) analysis and matched pair decomposition.
result Observation of mutual interactions between subdynamics in Vlasov plasma.
The modeling of atomistic biomolecular simulations using kinetic models such as Markov state models (MSMs) has had many notable algorithmic advances in recent years. The variational principle has opened the door for a nearly fully automated toolkit for selecting models that predict the long-time kinetics from molecular…
Gated attention improves performance by using a hierarchical mixture of experts.
problem Improving performance of self-attention mechanisms in Transformers.
method Rigorously show that gated attention can be modeled as a hierarchical mixture of experts, providing a theoretical justification for its benefits.
result Gated attention is more sample-efficient than multi-head self-attention, requiring fewer data points to achieve the same estimation error.
Given the success of the gated recurrent unit, a natural question is whether all the gates of the long short-term memory (LSTM) network are necessary. Previous research has shown that the forget gate is one of the most important gates in the LSTM. Here we show that a forget-gate-only version of the LSTM with chrono-ini…
We propose some kinetic models of wealth exchange and investigate their behavior on directed networks though numerical simulations. We observe that network topology and directedness yields a variety of interesting features in these models. The nature of asset distribution in such directed networks show varied results, …
Improved HMoE models using Laplace gating function enhance expert specialization and performance.
problem Improving performance of hierarchical mixture of experts models.
method Used Laplace gating function instead of Softmax in hierarchical mixture of experts models.
result Laplace gating function accelerates expert convergence and enhances specialization.
Gating units in GRUs and LSTMs create slow modes and control phase-space complexity.
problem Training challenges in RNNs due to exploding or vanishing gradients.
method Random matrix theory and mean-field theory applied to GRUs and LSTMs.
result Gates in GRUs and LSTMs lead to accumulation of slow modes and control phase-space complexity.
We introduce and discuss optimal control strategies for kinetic models for wealth distribution in a simple market economy, acting to minimize the variance of the wealth density among the population. Our analysis is based on a finite time horizon approximation, or model predictive control, of the corresponding control p…
New sampling method on Lie groups converges quickly.
problem Sampling on non-Euclidean Lie groups.
method Kinetic Langevin dynamics with noise added.
result Exponential convergence rate proved under W2 distance. New algorithms improve sampling from complex distributions.
problem Sampling from complex probability distributions efficiently.
method Regime-switching Langevin dynamics and Monte Carlo algorithms.
result Convergence guarantees and iteration complexities provided.