Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

169,181 papers · 148 categories

Trend · papers per month

17355269 · May 202619922001200920182026
48 results for reactive transport

Physics-informed neural networks simulate solute dispersion in shear flows, validating complex transport mechanisms.

problem Simulating complex solute dispersion in asymmetric reactive environments.
method Physics-informed neural networks (PINNs) embedded with governing equations and boundary conditions.
result PINNs accurately predict solute dispersion, validating transport diagnostics.

Machine learning speeds up chemical equilibrium calculations in reactive transport simulations.

problem High computational cost of chemical equilibrium calculations in reactive transport models.
method Machine learning method to quickly estimate new equilibrium states based on previous calculations.
result Achieved almost two orders of magnitude speedup in equilibrium calculations.

MPC outperforms reactive budgeting in non-stationary return environments.

problem Optimizing budget allocation under non-stationary returns.
method Receding-horizon Model Predictive Control (MPC) compared to reactive policies.
result MPC consistently outperforms reactive budgeting when return dynamics are predictable.

Dual Policy Iteration combines fast and slow policies for better reinforcement learning performance.

problem Improving reinforcement learning algorithms for practical applications.
method Alternates between a fast, reactive policy and a slow, non-reactive policy, optimizing both under each other's supervision.
result Demonstrates improved performance on various continuous control Markov Decision Processes.

Statistical learning improves reactive power control in distribution systems.

problem Challenges in reactive power control due to renewable energy sources and flexible loads.
method A deep neural network parameterizes the input-output relationship between grid states and optimal reactive power control. Unknown weights are learned offline to minimize power loss, and inference is fast with matrix-vector multiplications.
result Computational efficiency and robustness to random input perturbations demonstrated in a 47-bus distribution network.

A new algorithm improves efficiency and robustness of heuristic optimization in simulation-based problems.

problem Optimizing input parameters for stochastic simulation-based optimization.
method Reactive sample size algorithm based on parametric tests and indifference-zone selection.
result The reactive method improves efficiency and robustness of heuristic optimization techniques.

Enhances queue-reactive model for realistic limit order book simulation.

problem Realistic simulation of limit order books for market research and strategy development.
method Extends Queue-Reactive model with neural network for complex dependencies and varying market conditions.
result Captures key market properties like square-root law of market impact and order size patterns.

We present a new volatility model, simple to implement, that includes a leverage effect whose return-volatility correlation function fits to empirical observations. This model is able to capture both the "retarded effect" induced by the specific risk, and the "panic effect", which occurs whenever systematic risk become…

2012-09-24abs ↗pdf ↗

Unified model for market dynamics, linking price and order flow.

problem Modeling market dynamics and order flow in a unified framework.
method Markovian market model driven by a hidden Brownian efficient price, signal-driven and queue-reactive models.
result Stability of mid-price around efficient price at macroscopic scale, behavior as diffusion.

Machine learning models accurately predict the state and dynamics of reactive mixing.

problem Accurate prediction of reactive mixing for Earth and environmental science applications.
method Built a high-fidelity numerical model to simulate reactive mixing scenarios. Used 20 different machine learning emulators to classify mixing state and predict three QoIs.
result Ensemble methods and MLP models accurately predict the state of reactive mixing and QoIs, significantly faster than high-fidelity simulations.

A new framework uses stochastic optimal control to estimate rare events more accurately.

problem Estimating rare events like chemical reactions in biomolecules is computationally challenging.
method The approach casts committor estimation as a stochastic optimal control problem, developing direct and off-policy Value Matching losses.
result The framework yields more accurate committor estimates, reaction rates, and equilibrium constants.

Generative adversarial networks improve subgrid modeling in turbulent reactive flows.

problem Accurately predicting turbulent reactive flows in combustion problems.
method Physics-informed super-resolution GANs trained with unsupervised deep learning.
result Good results in a priori and a posteriori tests with decaying turbulence.

Algorithm improves reinforcement learning policies using offline data.

problem Improving reinforcement learning policies with limited online data.
method Designs a single non-reactive policy using offline data with provable guarantees.
result Algorithm achieves better policy quality with less online data.

Unsupervised ML method reveals hidden features in reactive-diffusion simulations.

problem Automating interpretation of large model outputs in reactive-diffusion simulations.
method NTFk using Non-negative Tensor Factorization (NTF) coupled with k-means clustering.
result Identifies additive features characterizing mixing behavior.

The paper proposes a data-driven method for optimal power flow and voltage regulation in distribution grids.

problem Optimal power flow and voltage regulation in decentralized power grids.
method The approach uses a network model, historic data, and regression to find functions approximating optimal reactive power injections for inverters.
result The method achieves near-optimal results in voltage- and capacity-constrained loss minimization and voltage flattening.

AIF improves physical AI agents' performance in dynamic environments.

problem Physical AI agents are less capable than biological agents in open-ended real-world environments.
method Developed from probability theory, Bayesian machine learning, variational inference, and Active Inference (AIF), grounded in the Free Energy Principle.
result AIF minimizes variational free energy and is well-suited to physical constraints.

Paper improves volatility estimation using a Queue-Reactive model.

problem Volatility estimation from high-frequency data is biased by microstructure noise.
method Uses Queue-Reactive model of limit order book to improve volatility estimation.
result Unified and alternation estimators lead to optimal mean squared error for integrated volatility.

Enhances diffusion-based sampling for molecular systems.

problem Inefficiency and thermodynamic mode miss in diffusion-based samplers for molecular systems.
method Introduces a sequential bias along collective variables (CVs) to encourage exploration and increase temperature in the projected space.
result Improves efficiency, mode discovery, and free energy estimation; first to demonstrate reactive sampling.

Designs a single policy for collecting data to train near-optimal policies.

problem Engineering overhead in deploying minimax procedures for stochastic linear contextual bandits.
method Designs a single stochastic policy to collect data from which a near-optimal policy can be extracted.
result The designed policy can collect data from which a near-optimal policy can be extracted.

Decouples critic chunk length from policy to improve policy reactivity and performance.

problem Bootstrapping bias and difficulty in extracting optimal policies from chunked critics.
method Optimizes policy against a distilled critic for partial action chunks, allowing shorter chunks for policy.
result Reliably outperforms prior methods on long-horizon offline goal-conditioned tasks.

RL optimizes trading algorithms to reduce market impact and costs.

problem Optimizing sophisticated trading algorithms to minimize market impact and costs.
method Reinforcement learning framework within a market simulator.
result RL-derived strategies consistently outperform baselines and operate near the efficient frontier.

Resonant machine learning uses electrical network dynamics to optimize learning efficiently.

problem Traditional energy-based learning models are dissipative and inefficient.
method Proposes a new learning framework with two energy components (active and reactive) to ensure active-power dissipation during learning.
result Support vectors in resonant SVMs correspond to self-sustained oscillations in an LC network.

Prophet predicts device qualities for FL to reduce training latency.

problem Bad candidate-selection leads to large training and reporting latency in FL.
method Each device predicts its own training and reporting phases using LSTM. The algorithm is implemented with DRL.
result The proposed approach outperforms reactive algorithms in real-world experiments.

Study develops a data-based model for in-cylinder pressure and cyclic variations in RCCI engines.

problem Lack of models capturing cyclic variations in combustion concepts like RCCI.
method Combines Principle Component Decomposition and Gaussian Process Regression.
result Model predicts combustion measures with high accuracy, especially peak-pressure rise-rate.

A new hierarchy quantifies agency in systems based on information processing.

problem Lack of a measurable, universal definition for agency in intelligent systems.
method Developed a bottom-up framework based on information processing hierarchy.
result Identified three orders of information processing (I, II, III) as necessary for agency.

A2MT learns agents to select which modalities to acquire at test time.

problem Learning agents to select modalities for multimodal temporal data acquisition.
method Perceiver IO architecture for active acquisition of multimodal temporal data.
result Agents successfully learn cost-reactive acquisition behavior on real-world datasets.

This paper proposes a general model for synchronized crowding behavior. An order parameter is introduced to quantify the level of synchronization which is shown a function of percentage of agents in reactive state. Further, synchronization is shown to be driven by the most active agents with the highest volatility. A t…

2016-12-04abs ↗pdf ↗

The paper develops a method to predict the latent deterioration phase in limit order books before stress is observed.

problem Limit order books can transition rapidly from stable to stressed conditions, making it difficult to detect the latent deterioration phase.
method The paper formalizes a three-regime causal data-generating process and proposes a trigger-based detector combining MAX aggregation of complementary signal channels, a rising-edge condition, and adaptive thresholding.
result The proposed method achieves mean lead-time of +18.6 timesteps with perfect precision and moderate coverage, outperforming classical change-point and microstructure baselines.

New algorithm extracts device profiles for short-term power predictions in commercial buildings.

problem Short-term power prediction in commercial buildings with high accuracy.
method Unsupervised extraction of device profiles from aggregate power measurements, disaggregation using particle swarm optimization, and state changes forecast by artificial neural networks.
result Developed approach outperforms existing methods with high accuracy.

An innovative method optimizes engine calibration to improve efficiency and reduce emissions.

problem Complex engines with many tunable parameters require efficient calibration methods.
method Combines Principal Component Decomposition with constrained Bayesian Optimization to minimize pressure curve deviation.
result Optimal engine calibration found after 64.4s with a 0.017% efficiency gain.

We study the relation between the trading behavior of agents and volatility in toy markets of adaptive inductively rational agents. We show that excess volatility, in such simplified markets, arises as a consequence of {\em i)} the neglect of market impact implicit in price taking behavior and of {\em ii)} excessive re…

2000-04-21abs ↗pdf ↗

Improved portfolio optimization method yields better risk-adjusted returns.

problem Optimizing global minimum variance portfolios with reduced risk.
method k-fold boosted kk-BAHC covariance cleaning procedure for correlation matrices.
result Our method outperforms other filtering methods in Sharpe ratios, despite higher turnover.

New methods estimate transport-growth pairs in unbalanced optimal transport.

problem Statistical guarantees for Monge-type estimation in unbalanced optimal transport remain limited.
method Developed two estimators for transport-growth pairs under different setups.
result Achieved minimax optimal rate for estimation of transport-growth pairs.

The paper models financial markets and real economy interactions using a large agent framework.

problem Understanding capital allocation and accumulation in financial markets and real economy interactions.
method Developed a field-formalism model to analyze interactions between financial markets and real economy with a large number of heterogeneous agents.
result The number of firms in each sector depends on the aggregate financial capital invested and expected long-term returns.

AMORE uses neural operators to efficiently predict multiple thermochemical states in stiff chemical kinetics.

problem Efficiently integrating stiff chemical kinetics systems to reduce computational cost.
method Developed AMORE, a framework of adaptive multi-output operator network with two adaptive loss functions.
result Demonstrated improved accuracy and efficiency in predicting thermochemical states from initial conditions.

Novel approach learns optimal transport using convex neural networks.

problem Learning optimal transport between distributions from samples.
method Solving a minimax optimization to learn two convex functions, representing the optimal transport map.
result The approach finds optimal transport mappings that are independent of initialization and can handle discontinuous distributions.