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.

168,695 papers · 148 categories

Trend · papers per month

65131196261 · Jun 202019922001200920172026
48 results for Reactivity Controlled Compression Ignition

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.

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.

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.

Recently, a novel class of Approximate Policy Iteration (API) algorithms have demonstrated impressive practical performance (e.g., ExIt from [2], AlphaGo-Zero from [27]). This new family of algorithms maintains, and alternately optimizes, two policies: a fast, reactive policy (e.g., a deep neural network) deployed at t…

2018-05-28abs ↗pdf ↗

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.

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.

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.

Distribution grids are currently challenged by frequent voltage excursions induced by intermittent solar generation. Smart inverters have been advocated as a fast-responding means to regulate voltage and minimize ohmic losses. Since optimal inverter coordination may be computationally challenging and preset local contr…

2018-07-10abs ↗pdf ↗

Paper proposes SCALLION and SCAFCOM for compressed FL with reduced communication.

problem Reducing communication overhead in Federated Learning with data heterogeneity and partial participation.
method Revisit and simplify stochastic controlled averaging, proposing SCALLION and SCAFCOM for unbiased and biased compression.
result SCALLION and SCAFCOM outperform existing methods in communication and computation complexities.

We introduce Recurrent Predictive State Policy (RPSP) networks, a recurrent architecture that brings insights from predictive state representations to reinforcement learning in partially observable environments. Predictive state policy networks consist of a recursive filter, which keeps track of a belief about the stat…

2018-03-05abs ↗pdf ↗

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 ↗

We present a reactive beta model that includes the leverage effect to allow hedge fund managers to target a near-zero beta for market neutral strategies. For this purpose, we derive a metric of correlation with leverage effect to identify the relation between the market beta and volatility changes. An empirical test ba…

2019-11-03abs ↗pdf ↗

We consider a simple stochastic differential equation for modeling bubbles in social context. A prime example is bubbles in asset pricing, but similar mechanisms may control a range of social phenomena driven by psychological factors (for example, popularity of rock groups, or a number of students pursuing a given majo…

2010-09-01abs ↗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.

Plan2Vec learns image representations without labels, improving control tasks.

problem Learning image representations without labeled data.
method Constructs a weighted graph using near-neighbor distances and extrapolates to global embedding.
result Plan2Vec achieves accurate long-term value estimates in control tasks with reduced computational and memory costs.

EControl improves fast distributed optimization with compression and error control.

problem Stable convergence issues in distributed training with compression.
method Proposes EControl to regulate error compensation and prove fast convergence.
result Proves fast convergence for EControl in various convex settings without additional assumptions.

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 method enhances signal recovery with FDR control.

problem Challenging signal recovery in compressive sensing.
method Knockoff-guided compressive sensing framework with FDR control.
result Guaranteed FDR control leads to more accurate signal reconstruction.

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.

Optimal Volt/VAR control rules are designed using deep neural networks.

problem Designing optimal Volt/VAR control rules for distributed energy resources (DERs).
method Formulate optimal rule design as a bilevel program, then reformulate it as training a deep neural network (DNN). Use proximal gradient descent (PGD) iterations to emulate Volt/VAR dynamics.
result The proposed solution can be adapted to single/multi-phase feeders and achieves enhanced steady-state voltage profiles.

We describe a general framework -- compressive statistical learning -- for resource-efficient large-scale learning: the training collection is compressed in one pass into a low-dimensional sketch (a vector of random empirical generalized moments) that captures the information relevant to the considered learning task. A…

2017-06-22abs ↗pdf ↗

GeoIB uses information geometry to control compression in deep learning models.

problem The indirect and biased nature of traditional IB implementations in deep learning.
method GeoIB uses Fisher-Rao and Jacobian-Frobenius terms to control information compression directly.
result GeoIB achieves better trade-off between accuracy and compression than traditional IB methods.

This paper connects Wasserstein distances to MMD norms for compressive statistical learning.

problem Comparing and controlling Wasserstein distances between probability distributions.
method Establishing conditions under which Wasserstein distances can be controlled by MMD norms.
result Introducing Wasserstein regularity for compressive statistical learning.

Efficiently compress pretrained models using RSI for improved predictive accuracy.

problem Efficiently compressing large pretrained models for practical deployment.
method Randomized subspace iteration (RSI) for low-rank approximation of pretrained models.
result RSI achieves near-optimal approximation quality and outperforms RSVD in predictive accuracy.

Recurrent Neural Networks (RNN) can be difficult to deploy on resource constrained devices due to their size.As a result, there is a need for compression techniques that can significantly compress RNNs without negatively impacting task accuracy. This paper introduces a method to compress RNNs for resource constrained e…

2019-06-07abs ↗pdf ↗

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.

Theoretical framework for neural network compression using sparsity norms.

problem Understanding and quantifying compressibility and accuracy trade-offs in neural networks.
method Using sparsity-sensitive ℓ_q-norm to characterize compressibility and developing adaptive pruning algorithms.
result Theoretical relationship between network sparsity and compressibility with controlled accuracy degradation.

CoDeQ simplifies joint model compression by integrating pruning and quantization.

problem Joint pruning and quantization methods are complex and require additional procedures.
method CoDeQ uses a dead-zone quantizer to directly induce sparsity and learn quantization parameters.
result CoDeQ achieves high sparsity and low-precision accuracy with minimal bit operations.

Performing signal processing tasks on compressive measurements of data has received great attention in recent years. In this paper, we extend previous work on compressive dictionary learning by showing that more general random projections may be used, including sparse ones. More precisely, we examine compressive K-mean…

2015-04-05abs ↗pdf ↗