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

Trend · papers per month

4794140187 · May 202619922001200920172026
48 results for Positivity violations

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.

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.

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.

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.

The positivity assumption, or the experimental treatment assignment (ETA) assumption, is important for identifiability in causal inference. Even if the positivity assumption holds, practical violations of this assumption may jeopardize the finite sample performance of the causal estimator. One of the consequences of pr…

2017-07-18abs ↗pdf ↗

Proves positive mass theorem for spin initial data sets with arbitrary ends and dominant energy shields.

problem Proving the positive mass theorem for spin initial data sets with various ends and energy shields.
method Modification of Witten's approach involving an additional independent timelike direction in the spinor bundle.
result Positive mass theorem for spin initial data sets with arbitrary ends and dominant energy shields.

Study functional confounders in causal inference, enabling estimable effects.

problem Causal inference challenges with functional confounders violating positivity.
method Functional interventions, functional positivity, gradient fields, Level-set Orthogonal Descent Estimation (LODE).
result Valid causal effect estimation under certain conditions.

The study provides a theory for causal machine learning with generalization bounds.

problem Lack of theoretical guarantees for causal machine learning algorithms.
method Introduces a novel change-of-measure inequality to bound model loss.
result Tight bounds on model loss in terms of treatment propensities deviation.

Submodularity is studied for convex risk measures, including Expected Shortfall.

problem Characterizing submodularity in convex risk measures.
method Analyzing submodularity properties of law-invariant coherent risk measures, including Expected Shortfall and Value-at-Risk.
result AES is submodular only when it reduces to ES, and empirical analysis shows AES violations are less frequent than VaR and ES violations.

Given only positive (P) and unlabeled (U) data, PU learning can train a binary classifier without any negative data. It has two building blocks: PU class-prior estimation (CPE) and PU classification; the latter has been well studied while the former has received less attention. Hitherto, the distributional-assumption-f…

2020-02-10abs ↗pdf ↗

Paper introduces MVS to detect non-Markovian observations in reinforcement learning.

problem Real-world sensors violate Markov property, leading to suboptimal reinforcement learning performance.
method Uses prediction-based Markov Violation Score (MVS) combining random forest and ridge regression.
result MVS detects non-Markovian structure in observation trajectories, quantifying its impact.

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.

Deep-MIL models fail to respect key MIL assumption, leading to incorrect learning.

problem Deep-MIL models learn anti-correlated instances, violating the standard MIL assumption.
method Proposed algorithmic unit tests to identify violations of MIL assumptions.
result Five prominent deep-MIL models fail algorithmic unit tests, revealing incorrect learning.

The paper addresses fairness in online learning by extending auditing schemes and presenting efficient algorithms.

problem Ensuring fairness in online learning while maximizing predictive accuracy.
method Extending auditing schemes to handle multiple auditors and presenting oracle-efficient algorithms.
result Presented algorithms achieve upper bounds on regret and fairness violations, improving on existing bounds.

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 ↗

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 ↗

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 ↗

Neural networks are increasingly deployed in real-world safety-critical domains such as autonomous driving, aircraft collision avoidance, and malware detection. However, these networks have been shown to often mispredict on inputs with minor adversarial or even accidental perturbations. Consequences of such errors can …

2018-09-19abs ↗pdf ↗

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.

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 ↗

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 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.

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.

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.

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 ↗

Paper relaxes faithfulness assumption for causal discovery using interventions.

problem Violation of faithfulness assumption in natural systems leads to incorrect causal structure identification.
method Use intervention-immediacy faithfulness assumption to identify causal structures with hard interventions.
result Interventions contain information about causal structure that can identify causal structures when faithfulness is violated.

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.

Higher-dimensional Schwarzschild spacetimes violate the Penrose property.

problem Causal behavior of higher-dimensional Schwarzschild spacetimes.
method Analyzing causal properties in (2+1)(2+1), (3+1)(3+1), and (d+1)(d+1) dimensions.
result The Penrose property does not hold for (d+1)(d+1) dimensional Schwarzschild if d>3d>3.

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.

We demonstrate how easy it is for modern machine-learned systems to violate common deontological ethical principles and social norms such as "favor the less fortunate," and "do not penalize good attributes." We propose that in some cases such ethical principles can be incorporated into a machine-learned model by adding…

2020-01-31abs ↗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 ↗

Quantum theory challenges traditional cause-effect relations, showing causal influences even without Bell inequality violations.

problem Challenging traditional concepts of cause-effect relations in quantum mechanics.
method Introducing a general framework to estimate causal influences without interventions or classical/quantum assumptions.
result Every pure bipartite entangled state violates classical bounds on causal influence, negating the idea that Bell inequalities are the only signature of incompatibility.

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 ↗

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.