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,742 papers · 148 categories

Trend · papers per month

10203040 · Mar 202619922001200920172026
48 results for instant enforcement

Paper introduces a new outer measure for continuous price paths with instant enforcement.

problem Defining a new outer measure for continuous price paths with instant enforcement.
method Introducing an outer measure on the space [0,+)imesΩ[0, +\infty) imes \Omega that assigns zero value to instantly blockable sets.
result Proves BDG inequalities and an Itô-type integral for the modified measure.

The paper proves ML estimators are strongly consistent for identifying edge weights in BAR models.

problem Identifying edge weights in Bernoulli Autoregressive (BAR) models.
method Maximum Likelihood (ML) estimation for two variants of BAR models.
result ML estimators are strongly consistent for edge weight identification.

Given a Lorentzian manifold (M,g)(M,g), a geodesic γγ in MM and a timelike Jacobi field Y\mathcal Y along γγ, we introduce a special class of instants along γγ that we call Y\mathcal Y-pseudo conjugate (or focal relatively to some initial orthogonal submanifold). We prove that the Y\mathcal Y-pseudo conjugate insta…

2007-11-19abs ↗pdf ↗

We introduce a new tool for predicting the evolution of an option for the cases where at some specific time, there is a high-degree of uncertainty for identifying its price. We work over the special case where we can predict the evolution of the system by joining a single price for the Option, defined at some specific …

2019-05-14abs ↗pdf ↗

The paper tackles fairness in forecasting and learning linear dynamical systems.

problem Under-representation bias in training data for multiple subgroups.
method Introducing subgroup-fair and instant-fair learning of LDS from multiple trajectories of varying lengths, using hierarchies of convexifications of non-commutative polynomial optimisation problems.
result Empirical results show both the beneficial impact of fairness considerations on statistical performance and encouraging effects of exploiting sparsity on run time.

In this paper we study the setting where features are added or change interpretation over time, which has applications in multiple domains such as retail, manufacturing, finance. In particular, we propose an approach to provably determine the time instant from which the new/changed features start becoming relevant with…

2017-04-29abs ↗pdf ↗

ALINE optimizes Bayesian inference and data acquisition by strategically querying informative data.

problem Strategic acquisition of informative data for Bayesian inference in challenging tasks.
method Unified framework combining amortized Bayesian inference and active data acquisition using a transformer architecture trained via reinforcement learning.
result ALINE delivers both instant and accurate inference along with efficient selection of informative points.

PINN-FEM combines PINNs and FEM for accurate Dirichlet boundary condition enforcement.

problem Challenges in enforcing Dirichlet boundary conditions in PINNs.
method Hybrid approach combining PINNs and FEM for strong boundary condition enforcement.
result PINN-FEM outperforms standard PINN models in accuracy and robustness.

FLAP adapts policies quickly to new tasks using shared linear representations.

problem Adapting policies to new tasks efficiently and effectively.
method FLAP uses a shared linear representation and a separate adapter network for quick adaptation.
result FLAP achieves up to 8X faster adaptation and significantly better performance on out-of-distribution tasks.

The study examines if enforcing fairness helps mitigate bias due to demographic shifts.

problem Bias in ML models due to underrepresented subpopulations in training data.
method Theoretical and simulation analysis of fairness enforcement in target domains.
result Enforcing fairness can lead to the Bayes model in the target domain under certain conditions.

POLICE enforces linear constraints on deep neural networks efficiently.

problem Enforcing constraints on deep neural networks without affecting optimization.
method Provably optimal affine constraint enforcement method that minimally modifies DNNs.
result POLICE ensures DNNs fulfill affine constraints during training and testing.

A number of machine learning (ML) methods have been proposed recently to maximize model predictive accuracy while enforcing notions of group parity or fairness across sub-populations. We propose a desirable property for these procedures, slack-consistency: For any individual, the predictions of the model should be mono…

2019-10-04abs ↗pdf ↗

Study dynamic portfolio choice under rotating drivers, revealing a new geometric structure.

problem Investment under changing drivers with mutual independence.
method Analyzes geometric structure of portfolio choice, focusing on drivers and their rotation.
result Optimal policy separates into static and hedging components, reflecting the dynamic nature of drivers.

New algorithms detect anomalies in processes with minimal delay.

problem Sequentially selecting and observing processes to identify anomalies.
method Developed centralized and decentralized anomaly detection algorithms using reinforcement learning.
result Minimizes delay in decision making while identifying anomalies accurately.

GER learns particle dynamics from unpaired snapshots using physics-informed GANs.

problem Learning particle dynamics from unpaired snapshots with physics constraints.
method Physics-informed generative model to fit particle ensemble distributions.
result Inferred dynamics of particle ensembles governed by SODEs up to 100 dimensions.

COSMIC identifies LTV systems from large data sets efficiently.

problem Identification of discrete-time linear time-variant systems from large-scale data.
method Formulates as regularized least squares problem, develops closed-form algorithm with linear complexity.
result Achieves optimal results even with large data volumes, significantly faster than general solvers.

This paper explores how enforcing equivariance constraints limits neural network expressivity and proposes compensatory model size increases.

problem The impact of enforcing equivariance constraints on the expressive power of neural networks.
method Examined 2-layer ReLU networks, analyzed boundary hyperplanes and channel vectors, and constructed upper bounds on model size required for compensation.
result Enforcing equivariance constraints reduces the expressive power of neural networks, but this can be compensated by increasing model size.

New algorithms reduce orthogonality constraint enforcement time in machine learning.

problem Efficiently solving orthogonality constraints in machine learning.
method Extending the landing algorithm to Stiefel manifold, incorporating stochastic and variance reduction techniques.
result All proposed methods achieve the same convergence rate as Riemannian counterparts enforcing constraints.

Enforcing distributions of latent variables in neural networks is an active subject. It is vital in all kinds of generative models, where we want to be able to interpolate between points in the latent space, or sample from it. Modern generative AutoEncoders (AE) like WAE, SWAE, CWAE add a regularizer to the standard (d…

2019-03-28abs ↗pdf ↗

In this paper, we present Gamma-LSTM, an enhanced long short term memory (LSTM) unit, to enable learning of hierarchical representations through multiple stages of temporal abstractions. Gamma memory, a hierarchical memory unit, forms the central memory of Gamma-LSTM with gates to regulate the information flow into var…

2019-10-25abs ↗pdf ↗

Develops a deep learning method for enforcing no-arbitrage in local volatility surfaces.

problem No-arbitrage conditions not enforced in deep learning approaches for local volatility.
method Jointly interpolates European vanilla option prices, enforcing no-arbitrage through modified loss functions or network architectures.
result Demonstrates the effectiveness of enforcing no-arbitrage in local volatility surfaces using deep learning.

Study finds bifurcation and local rigidity points for solutions to the Yamabe problem on Aloff-Wallach Spaces.

problem Yamabe problem on Aloff-Wallach Spaces
method Constructing 1-parameter families of solutions and examining changes in the Morse index as the parameter varies.
result Identifies bifurcation and local rigidity points for homogeneous solutions to the Yamabe problem.

A statistical generalization is made of microeconomics in the spirit of going from classical to statistical mechanics. The price and quantity of every commodity1 traded in the market, at each instant of time, is considered to be an independent random variable: all prices and quantities are considered to be stochastic p…

2012-11-30abs ↗pdf ↗
Critical Crashescond-mat.stat-mech

We argue that the word ``critical'' in the title is not purely literary. Based on our and other previous work on nonlinear complex dynamical systems, we summarize present evidence, on the Oct. 1929, Oct. 1987, Oct. 1987 Hong-Kong, Aug. 1998 global market events and on the 1985 Forex event, for the hypothesis advanced f…

1999-01-06abs ↗pdf ↗

Study shows physical drift affects put-call parity enforcement, not just option payoffs.

problem Inconsistency between quoted put-call parity and actual market behavior.
method Examined SPX and RUT index options, used drift-preserving GBM term to improve fit.
result Physical drift enters the enforcement of risk-neutral parity, not just option payoffs.

Low bit-width integer weights and activations are very important for efficient inference, especially with respect to lower power consumption. We propose Monte Carlo methods to quantize the weights and activations of pre-trained neural networks without any re-training. By performing importance sampling we obtain quantiz…

2019-05-29abs ↗pdf ↗

Task offloading is a promising technology to exploit the benefits of fog computing. An effective task offloading strategy is needed to utilize the computational resources efficiently. In this paper, we endeavor to seek an online task offloading strategy to minimize the long-term latency. In particular, we formulate a s…

2018-04-20abs ↗pdf ↗

Study tests how U.S. equity prices align with global asset frequencies using financial variables.

problem Testing whether U.S. equity prices align with global asset frequencies using financial variables.
method Examines SPX and RUT gaps, uses OIS-based funding, volatility, trading-friction, financial-condition variables, and residual information.
result Gains in fit survive broad-dollar neutralization, alternative blocks, PCA, residualization, and nested horizon selection, supporting reduced-form P-Q alignment.