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

3557101,0641,419 · Jun 202019922001200920172026
48 results for model violations

Bayesian methods detect significant IIA violations in similarity choice data.

problem Detecting IIA violations in similarity choice data complicates classical models.
method Proposed two statistical methods: classical goodness-of-fit test and Bayesian PPC.
result Significant IIA violations confirmed in both datasets, driven by context effects.

NucleusDiff models atomic nuclei interactions to prevent separation violations in drug design.

problem Maintaining minimum pairwise distance between atoms to avoid separation violations in drug design.
method Enforces distance constraint between atomic nuclei and manifolds in a diffusion model.
result Reduces separation violations by up to 100.00% and enhances binding affinity by up to 22.16%.

New algorithm reduces sample complexity for safe reinforcement learning.

problem Safe reinforcement learning in constrained MDPs with performance and safety constraints.
method Model-based primal-dual algorithm balancing regret and bounded constraint violations.
result Proves near-optimal policies with bounded violations or zero violations in CMDPs.

The study proves strong cosmic censorship violation for spherically symmetric dust clouds.

problem Violation of strong cosmic censorship for spherically symmetric dust clouds.
method Derived an ordinary differential equation for light rays and used it to prove strong cosmic censorship violation.
result Generic violation of strong cosmic censorship for spherically symmetric dust clouds.

We present a new approach to assessing the robustness of neural networks based on estimating the proportion of inputs for which a property is violated. Specifically, we estimate the probability of the event that the property is violated under an input model. Our approach critically varies from the formal verification f…

2018-11-17abs ↗pdf ↗

Causality violations are typically seen as unrealistic and undesirable features of a physical model. The following points out three reasons why causality violations, which Bonnor and Steadman identified even in solutions to the Einstein equation referring to ordinary laboratory situations, are not necessarily undesirab…

2006-09-15abs ↗pdf ↗

CausalCompass evaluates TSCD robustness under violations of modeling assumptions.

problem Widespread adoption of TSCD is hindered by untestable causal assumptions and lack of robustness evaluation.
method CausalCompass is a flexible benchmark framework for assessing TSCD robustness under violations of modeling assumptions.
result No single method consistently attains optimal performance across all settings, but deep learning-based methods perform well.

TMLE improves causal effect estimation in missing data scenarios with various positivity violations.

problem Estimating causal effects in studies with missing data and positivity violations.
method Targeted Maximum Likelihood Estimation (TMLE) with various missing data methods.
result Complete cases with TMLE incorporating an outcome-missingness model exhibit lower bias and greater robustness against positivity violations.

Differentiable causal discovery methods perform robustly under model violations.

problem Causal discovery algorithms struggle with real-world data due to unverifiable causal assumptions.
method Benchmarked differentiable causal discovery methods under eight model assumption violations.
result Differentiable causal discovery methods exhibit robust performance under Structural Hamming Distance and Structural Intervention Distance metrics.

Paper tackles constrained bandit problems with a new learning framework.

problem Optimizing a black-box reward function subject to a black-box constraint function over a continuous space.
method Rectified Pessimistic-Optimistic Learning (RPOL) framework, incorporating optimistic and pessimistic GP bandit learning.
result RPOL achieves sublinear regret and minimal cumulative constraint violation.

The correspondence between Riemann-Finsler geometries and effective field theories with spin-independent Lorentz violation is explored. We obtain the general quadratic action for effective scalar field theories in any spacetime dimension with Lorentz-violating operators of arbitrary mass dimension. Classical relativist…

2018-09-14abs ↗pdf ↗

Effective field theories with explicit Lorentz violation are intimately linked to Riemann-Finsler geometry. The quadratic single-fermion restriction of the Standard-Model Extension provides a rich source of pseudo-Riemann-Finsler spacetimes and Riemann-Finsler spaces. An example is presented that is constructed from a …

2011-04-28abs ↗pdf ↗

New RL algorithm achieves sublinear regret and constraint violation without simulators.

problem Maximizing reward under utility constraints in large-scale systems.
method Model-free, simulator-free algorithm using LSVI-UCB with primal-dual optimization and soft-max policy.
result Achieves ildeO(d3H3T) ilde{\mathcal{O}}(\sqrt{d^3H^3T}) regret and ildeO(d3H3T) ilde{\mathcal{O}}(\sqrt{d^3H^3T}) constraint violation bounds.

A new method tests Expected Shortfall by analyzing both duration and severity of VaR violations.

problem Lack of separate testing for frequency and severity in ES backtesting.
method Uses bivariate orthogonal polynomials to derive moment conditions for durations and severities.
result Proposes a Wald test for identifying mis-specified components in ES models.

Certain momentum-dependent terms in the fermion sector of the Lorentz-violating Standard Model Extension (SME) yield solvable classical lagrangians of a type not mentioned in the literature. These cases yield new relatively simple examples of Finsler and pseudo-Finsler structures. One of the cases involves antisymmetri…

2012-01-18abs ↗pdf ↗

The physics of classical particles in a Lorentz-breaking spacetime has numerous features resembling the properties of Finsler geometry. In particular, the Lagrange function plays a role similar to that of a Finsler structure function. A summary is presented of recent results, including new calculable Finsler structures…

2013-08-15abs ↗pdf ↗

Detecting faults and SLA violations in a timely manner is critical for telecom providers, in order to avoid loss in business, revenue and reputation. At the same time predicting SLA violations for user services in telecom environments is difficult, due to time-varying user demands and infrastructure load conditions. In…

2015-09-04abs ↗pdf ↗

CVTMLE improves statistical inference in settings of positivity or Donsker class violations.

problem Inference issues in causal inference due to data sparsity or near-positivity violations.
method Cross-validation of TMLE (CVTMLE) to improve performance in settings of positivity or Donsker class violations.
result CVTMLE vastly improves confidence interval coverage without affecting bias, especially in small sample sizes and near-positivity violations.

This paper considers online convex optimization over a complicated constraint set, which typically consists of multiple functional constraints and a set constraint. The conventional online projection algorithm (Zinkevich, 2003) can be difficult to implement due to the potentially high computation complexity of the proj…

2016-04-08abs ↗pdf ↗

This work compares regularization and constrained inference for label constraints in machine learning.

problem Improving model performance with label constraints in machine learning.
method Comparison of regularization and constrained inference strategies.
result Constrained inference reduces population risk by correcting model violations, while regularization narrows the generalization gap but introduces bias.

New algorithm reduces regret and constraint violation in online convex optimization with complex constraints.

problem Online convex optimization with multiple functional constraints and a simple constraint set.
method Instance-dependent bound using online primal-dual mirror-prox algorithm in general normed spaces.
result Achieves an O(√V*(T)) regret and O(1) constraint violation, improving over previous works.

Optimistic algorithm reduces regret and constraint violations in online convex optimization with adversarial constraints.

problem Online convex optimization with adversarial constraints.
method Improved algorithm using accurate predictions of loss and constraint functions.
result Improved bounds on regret and cumulative constraint violations.

Algorithm minimizes loss and constraint violations in online convex optimization with smooth penalties.

problem Minimizing loss and constraint violations in online convex optimization with smooth penalties.
method Projected gradient descent over a set around the current action.
result Both dynamic regret and constraint violation are bounded by the path-length.

Bell's theorem shows quantum correlations can't be explained by classical causal models, even with some measurement dependence.

problem Quantum correlations violate classical causal models.
method Using causal networks, the study bounds the level of measurement dependence and derives nonlinear Bell inequalities.
result Quantum correlations can't be explained by classical causal models even with some measurement dependence.

Urban traffic systems worldwide are suffering from severe traffic safety problems. Traffic safety is affected by many complex factors, and heavily related to all drivers' behaviors involved in traffic system. Drivers with aggressive driving behaviors increase the risk of traffic accidents. In order to manage the safety…

2018-11-28abs ↗pdf ↗

Proposes TSCI method to infer causal effects with weak or invalid instruments using machine learning.

problem Causal inference with weak or invalid instrumental variables.
method Two-stage curvature identification (TSCI) using machine learning.
result Asymptotically unbiased and Gaussian estimator for causal effects.

Paper develops robust methods for panel data with latent groups, improving inference under group separation violations.

problem Inference in latent group panel models under group separation violations.
method Selective conditional inference approach to derive conditional distribution of coefficients given estimated group structure.
result Valid inference under violations of group separation, superior to traditional asymptotic methods.

SurvSurf predicts first hitting times for intermittent events without monotonic violations.

problem Predicting first hitting times for intermittent events with monotonicity guarantees.
method Partially monotonic neural network for sequential events, incorporating unobserved events.
result SurvSurf outperforms existing models in MSE and IBS metrics.

Simulation study evaluates causal ML models under confounding violations.

problem Assessing conditional exchangeability in causal machine learning models.
method Simulation study with varying confounding, sample size, and NCO structures.
result Causal ML models fail to recover true treatment effect heterogeneity under violations of conditional exchangeability.

Measures policy-violating content prevalence with ML-assisted sampling and LLM labeling.

problem Accurate measurement of content violations that are often rare and costly to label.
method Design-based measurement system using ML-assisted probability sampling and LLM labeling.
result Produces unbiased prevalence estimates with confidence intervals and dashboard drilldowns.

This paper detects Markov violations in RL with noise, improving policy development.

problem Partial observability and sensor/actuator noise invalidate Markovian assumptions in RL.
method Combines PCMCI causal discovery with Markov Violation score (MVS).
result Even substantial noise doesn't always disrupt multi-step dependencies.

New algorithms control loss and constraints in uncertain, changing environments.

problem Adapting to adversarial constraints in uncertain, changing environments.
method Developed algorithms for constrained MAB problems with optimal rates of regret and positive constraint violation.
result Achieved optimal rates of regret and positive constraint violation under varying degrees of adversariality.

When dealing with Heston's stochastic volatility model, the change of measure from the subjective measure P to the objective measure Q is usually investigated under the assumption that the Feller condition is satisfied. This paper closes this gap in the literature by deriving sufficient conditions for the existence of …

2018-09-28abs ↗pdf ↗

In this paper, we propose a novel technique to implement stochastic gradient methods, which are beneficial for learning from large datasets, through accelerated stochastic dynamics. A stochastic gradient method is based on mini-batch learning for reducing the computational cost when the amount of data is large. The sto…

2015-11-19abs ↗pdf ↗

Proposes real-time risk monitoring for machine learning systems under unknown shifts.

problem Dynamic distribution shifts challenge real-world machine learning systems' risk assurances.
method Sequential hypothesis testing with 'testing by betting' to detect risk violations.
result Effective real-time risk monitoring under various unknown shifts.

Testing procedures for predictive regressions with lagged autoregressive variables imply a suboptimal inference in presence of small violations of ideal assumptions. We propose a novel testing framework resistant to such violations, which is consistent with nearly integrated regressors and applicable to multi-predictor…

2016-12-15abs ↗pdf ↗