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

15304560 · Jun 202019922001200920172026
48 results for public acceptance

Benchmarking recursive collapse claims with a new framework under false-positive control.

problem Evaluating recursive systems for failure patterns and warning claims.
method Developed Loopzero framework for testing recursive failures, specified claim boundaries in Lean, evaluated under FP constraint, and compared with standard detectors.
result No standard detectors or Loopzero's pre-registered quantile detector achieved the required operating point under the false-positive contract.

This text discusses several popular explanatory methods that go beyond the error measurements and plots traditionally used to assess machine learning models. Some of the explanatory methods are accepted tools of the trade while others are rigorously derived and backed by long-standing theory. The methods, decision tree…

2018-10-05abs ↗pdf ↗

ToolChain-CRC addresses the risk-control problem for retrieval-augmented and tool-using agents under drift.

problem Risk-control problem for retrieval-augmented and tool-using agents under drift.
method ToolChain-CRC uses conformal risk-control under exchangeable calibration runs.
result Trajectory-level risk control keeps accepted-trajectory risk below the target.

We compute the sets of degrees of maps between principal SU(2)SU(2)-bundles over S5S^5, i.e. between any of the manifolds SU(2)×S5SU(2)\times S^5 and SU(3)SU(3). We show that the Steenrod squares provide the only obstruction to the existence of a mapping degree between these manifolds, and construct explicit maps realizing each in…

2017-10-28abs ↗pdf ↗

Simple conditions for comonotonic additive risk measures from acceptance sets.

problem Conditions for comonotonic additive risk measures from acceptance sets.
method Conditions on acceptance sets for induced comonotonic additive risk measures.
result Acceptance sets induce comonotonic additive risk measures if and only if the acceptance sets and their complements are stable under convex combinations of comonotonic random variables.

Following Ghomi and Tabachnikov we study topological obstructions to totally skew embeddings of a smooth manifold M in Euclidean spaces. This problem is naturally related to the question of estimating the geometric dimension of the stable normal bundle of the configuration space F_2(M) of ordered pairs of distinct poin…

2010-05-20abs ↗pdf ↗

The paper develops a theory for speculative decoding acceptance criteria.

problem Speculative decoding's acceptance criteria and their rejection regions.
method Characterization of rejection regions as lower level sets of the target distribution, derivation of exact and margin-based certificates.
result Relaxed and tree-based acceptance criteria substantially enlarge the region of certified acceptance.

New simulation shows trading algorithms' performance varies with parallelism.

problem Validation of trading algorithms' performance in parallel markets.
method Used TBSE, a threaded market simulator, to compare algorithms' performance.
result Trading algorithms' performance differs in parallel vs. sequential markets.

Six AI solutions accurately detect growth plate planes in mice bone scans.

problem Manual, time-consuming, and variable bone growth plate detection in micro-CT scans.
method Prepared and annotated a dataset of 3D μCT scans, organized a challenge, and developed six computer vision solutions.
result Achieved mean absolute error of 1.91±0.87 planes from ground truth.

Cactus improves auto-regressive decoding speed without sacrificing quality.

problem Accelerating auto-regressive decoding while maintaining output quality.
method Formalizes speculative sampling as constrained optimization and proposes Cactus for controlled divergence from the verifier distribution.
result Empirically validated effectiveness across various benchmarks.

As the decade turns, we reflect on nearly thirty years of successful manipulation of the world's public equity markets. This reflection highlights a few of the key enabling ingredients and lessons learned along the way. A quantitative understanding of market impact and its decay, which we cover briefly, lets you move l…

2019-11-20abs ↗pdf ↗

Improves algorithmic recourse to guide towards both acceptance and improvement.

problem Algorithmic recourse recommendations may not lead to improvement.
method Improvement-Focused Causal Recourse (ICR) requires recommendations to guide towards improvement and leverages causal knowledge to design accurate decision systems.
result ICR guides towards both acceptance and improvement given correct causal knowledge.

Language evolves over time in many ways relevant to natural language processing tasks. For example, recent occurrences of tokens 'BERT' and 'ELMO' in publications refer to neural network architectures rather than persons. This type of temporal signal is typically overlooked, but is important if one aims to deploy a mac…

2019-09-08abs ↗pdf ↗

The paper studies optimal investment using acceptability indices to maximize portfolio performance.

problem Optimal investment problem using coherent acceptability indices.
method Numerical algorithm approximating the original problem, dynamic coherent risk measures, set-valued Bellman's principle.
result Acceptability maximization problem reduces to a one-period problem under certain conditions.

Estimates boundaries for acceptable bilateral gamma risk in financial markets.

problem Determining the compensation needed for risky future cash flows to be considered acceptable.
method Statistical inference from market prices and derivatives, using prospect theory.
result Upper and lower boundaries for bilateral gamma risk are estimated and tested against market data.

We consider a trader who wants to direct his portfolio towards a set of acceptable wealths given by a convex risk measure. We propose a black-box algorithm, whose inputs are the joint law of stock prices and the convex risk measure, and whose outputs are the numerical values of initial capital requirement and the funct…

2006-07-25abs ↗pdf ↗

Study financial contracts pricing in markets with nonproportional costs and constraints.

problem Financial contract pricing in markets with nonproportional transaction costs and portfolio constraints.
method Direct and dual characterization of market-consistent prices with acceptable risk thresholds.
result Extension of the Fundamental Theorem of Asset Pricing to include good deals and scalable good deals.

Model uses Preisach hysteresis to predict gig worker acceptance, reducing costs and improving fill rates.

problem Predicting and optimizing gig worker acceptance in labor markets.
method Preisach hysteresis model applied to neural network and XGBoost classifier for binary transaction outcomes.
result Model reduces total wage bill by 21.3% and increases expected fill rate by 9.7 pp.

Optimizes a portfolio for an investor preferring accepted securities over a reference security.

problem Investor preference for a set of securities over a reference security with constraints.
method Mean-variance optimization with Sharpe Ratio performance measurement.
result Derives an optimal portfolio that maximizes returns while minimizing risk.

The theory of acceptance sets and their associated risk measures plays a key role in the design of capital adequacy tests. The objective of this paper is to investigate, in the context of bounded financial positions, the class of surplus-invariant acceptance sets. These are characterized by the fact that acceptability …

2014-01-14abs ↗pdf ↗

Research examines motivations and factors influencing retailers' payment method choices.

problem Understanding motivations and factors affecting retailers' payment method choices.
method Qualitative and quantitative analysis of various factors including regulatory constraints, merchant service providers, and demographic variables.
result Lower interchange fees and regulatory constraints make card payment adoption financially feasible for merchants.

Monetary risk measures are usually interpreted as the smallest amount of external capital that must be added to a financial position to make it acceptable. We propose a new concept: intrinsic risk measures and argue that this approach provides a direct path from unacceptable positions towards the acceptance set. Intrin…

2016-10-27abs ↗pdf ↗

Indices of acceptability are well suited to frame the axiomatic features of many performance measures, associated to terminal random cash flows.We extend this notion to classes of càdlàg processes modelling cash flows over a fixed investment horizon.We provide a representation result for bounded paths. We suggest an ac…

2019-11-06abs ↗pdf ↗

Generation of pseudorandom numbers from different probability distributions has been studied extensively in the Monte Carlo simulation literature. Two standard generation techniques are the acceptance-rejection and inverse transformation methods. An alternative approach to Monte Carlo simulation is the quasi-Monte Carl…

2014-03-22abs ↗pdf ↗

Proposes a method to estimate acceptance regions for many classes, including new ones.

problem Lack of methods to handle new classes in set-valued classification.
method Generalized Prediction Set (GPS) approach to estimate acceptance regions.
result Achieves a good balance between accuracy, efficiency, and anomaly detection.

The risk of financial positions is measured by the minimum amount of capital to raise and invest in eligible portfolios of traded assets in order to meet a prescribed acceptability constraint. We investigate nondegeneracy, finiteness and continuity properties of these risk measures with respect to multiple eligible ass…

2013-08-15abs ↗pdf ↗

Improved sampling for Bayesian neural networks reduces vanishing acceptance rates and increases predictive accuracy.

problem Sampling inefficiency in Bayesian neural networks, especially with deep architectures and large datasets.
method Approximate blocked Gibbs sampling to partition and sample subgroups of parameters.
result Increased predictive accuracy and quantification of predictive uncertainty in classification tasks.

Co-TSFA improves time series forecasting by distinguishing between short-lived and persistent anomalies.

problem Standard forecasting models fail to distinguish between short-lived and persistent anomalies, leading to overreaction or underreaction.
method Co-TSFA learns to ignore forecast-irrelevant anomalies and respond to forecast-relevant ones through input-only and input-output augmentations and a latent-output alignment loss.
result Co-TSFA improves performance under anomalous conditions while maintaining accuracy on normal data.