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

Trend · papers per month

1234 · Feb 201919922001200920172026
48 results for Kerridge inaccuracy

New dispersion indices based on inaccuracy and divergence introduced for information measures.

problem Measuring variability in uncertainty measures.
method Introducing new dispersion indices based on Kerridge inaccuracy and Kullback-Leibler divergence.
result Properties, bounds, and examples of new dispersion indices presented.

New method reduces inventory inaccuracies by 10x, saving retailers 4% annually.

problem Inaccurate inventory records cost retailers 4% annually, and manual detection is impractical.
method Proposes a new anomaly detection method for low-rank Poisson matrices using cross-sectional data.
result Our approach reduces anomaly detection costs by up to 10x compared to existing methods.

Study finds inventory inaccuracies are linked to store activity and product perishability.

problem Inventory record inaccuracy in grocery retailing environments.
method Analysis of 24,000 SKUs across 11 stores, field quasi-experiment on audits.
result Inventory audits can boost sales by 11%, especially for perishable items.

Cost-benefit analysis often assumes accurate estimates, but this study finds significant inaccuracies.

problem Inaccurate cost and benefit estimates in public investments.
method Largest dataset of public investments, statistical analysis of cost overruns and benefit shortfalls.
result Significant inaccuracies in cost and benefit estimates of public investments.

A major source of risk in project management is inaccurate forecasts of project costs, demand, and other impacts. The paper presents a promising new approach to mitigating such risk, based on theories of decision making under uncertainty which won the 2002 Nobel prize in economics. First, the paper documents inaccuracy…

2013-02-14abs ↗pdf ↗

Inexact acquisition solutions in BO lead to sublinear cumulative regret.

problem Inexact maximization of acquisition functions in Bayesian optimization.
method Define inaccuracy measure, establish cumulative regret bounds for GP-UCB and GP-TS.
result Inexact BO algorithms can achieve sublinear cumulative regret under appropriate inaccuracy conditions.

Due to its length and several inaccuracies, this article is no longer suggested for reading. Moreover, in the meantime certain results presented herein could be improved by the author in a non-trivial fashion. Instead, the reader is referred to the following two articles: The extrinsic holonomy Lie algebra of a paralle…

2008-09-11abs ↗pdf ↗

Practically, we are often in the dilemma that the labeled data at hand are inadequate to train a reliable classifier, and more seriously, some of these labeled data may be mistakenly labeled due to the various human factors. Therefore, this paper proposes a novel semi-supervised learning paradigm that can handle both l…

2019-02-20abs ↗pdf ↗

Every symplectic Lie algebra with degenerate (including non-abelian nilpotent symplectic Lie algebras) has the structure of a quadratic extension. We give a standard model and describe the equivalence classes on the level of corresponding quadratic cohomology sets. Finally, we give a scheme to classify the isomorphism …

2016-09-12abs ↗pdf ↗

Nonparametric mixture models based on the Dirichlet process are an elegant alternative to finite models when the number of underlying components is unknown, but inference in such models can be slow. Existing attempts to parallelize inference in such models have relied on introducing approximations, which can lead to in…

2012-11-29abs ↗pdf ↗

Trajectory optimization using a learned model of the environment is one of the core elements of model-based reinforcement learning. This procedure often suffers from exploiting inaccuracies of the learned model. We propose to regularize trajectory optimization by means of a denoising autoencoder that is trained on the …

2019-03-28abs ↗pdf ↗

Bayesian models quantify uncertainty and facilitate optimal decision-making in downstream applications. For most models, however, practitioners are forced to use approximate inference techniques that lead to sub-optimal decisions due to incorrect posterior predictive distributions. We present a novel approach that corr…

2019-09-11abs ↗pdf ↗

Often machine learning methods are applied and results reported in cases where there is little to no information concerning accuracy of the output. Simply because a computer program returns a result does not insure its validity. If decisions are to be made based on such results it is important to have some notion of th…

2019-12-08abs ↗pdf ↗

This paper is an updated version of a survey on projective configurations of subspaces in general position. The preceding version was published in Russian in 1989 and in English in 1990 (in Leningrad Math. J.) opening a new section ``Light reading for the professional''. The paper is written in the form of introduction…

2006-11-13abs ↗pdf ↗

This book is a detailed introduction to the theory of finite type (Vassiliev) knot invariants, with a stress on its combinatorial aspects. It is intended to serve both as a textbook for readers with no or little background in this area, and as a guide to some of the more advanced material. Our aim is to lead the reader…

2011-03-24abs ↗pdf ↗

Donald Trump was lagging behind in nearly all opinion polls leading up to the 2016 US presidential election, but he surprisingly won the election. This raises the following important questions: 1) why most opinion polls were not accurate in 2016? and 2) how to improve the accuracies of opinion polls? In this paper, we …

2018-12-31abs ↗pdf ↗

Improved bounds for proximal gradient algorithms with computational errors.

problem Analyzing convergence of proximal gradient algorithms with inaccuracies.
method Deriving new tighter deterministic and probabilistic bounds for convex composite problems.
result Probabilistic bounds are more robust and accurate for algorithm verification and performance guarantees.

Model-based reinforcement learning could enable sample-efficient learning by quickly acquiring rich knowledge about the world and using it to improve behaviour without additional data. Learned dynamics models can be directly used for planning actions but this has been challenging because of inaccuracies in the learned …

2019-10-12abs ↗pdf ↗

Novel method for solving ODEs on k-polysymplectic manifolds.

problem Solving ordinary differential equations on k-polysymplectic manifolds.
method k-polysymplectic energy-momentum method.
result Novel stability analysis techniques applied to Hamiltonian systems.

Paper discusses directional differentiability of interval-valued functions on Riemannian manifolds.

problem Equivalence of directional differentiability of interval-valued functions and their components.
method Analyzes directional differentiability of interval-valued functions on Riemannian manifolds.
result Directional differentiability of interval-valued functions is not equivalent to the directional differentiability of their components.

The abundance of data produced daily from large variety of sources has boosted the need of novel approaches on causal inference analysis from observational data. Observational data often contain noisy or missing entries. Moreover, causal inference studies may require unobserved high-level information which needs to be …

2017-03-13abs ↗pdf ↗

Online health communities are a valuable source of information for patients and physicians. However, such user-generated resources are often plagued by inaccuracies and misinformation. In this work we propose a method for automatically establishing the credibility of user-generated medical statements and the trustworth…

2017-05-06abs ↗pdf ↗

Neural network accuracy improves with denser training samples.

problem Improving neural network accuracy on unseen test samples.
method Bounding empirical training error smoothed across activation regions and using it to discard high-risk test samples.
result Discarding high-risk test samples based on error bounds improves prediction accuracy by up to 20%.

Improved sample efficiency in reinforcement learning with deep Gaussian processes.

problem Efficiently learn to control actions with limited interaction data.
method Deep Gaussian processes that simulate dynamics with depth and prior knowledge.
result Significantly improved early sample efficiency across various tasks, including half-cheetah control.

New IF method improves accuracy in deep neural networks with noisy data.

problem Inaccurate influence estimates in deep neural networks, especially with noisy data.
method Established a connection between influence estimation error, validation set risk, and sharpness, introducing a novel estimation form for flat validation minima.
result Our novel Influence Function approach provides more accurate influence estimates, validated across various tasks.

Model-based reinforcement learning is an appealing framework for creating agents that learn, plan, and act in sequential environments. Model-based algorithms typically involve learning a transition model that takes a state and an action and outputs the next state---a one-step model. This model can be composed with itse…

2019-05-30abs ↗pdf ↗

Pointer generator networks have been used successfully for abstractive summarization. Along with the capability to generate novel words, it also allows the model to copy from the input text to handle out-of-vocabulary words. In this paper, we point out two key shortcomings of the summaries generated with this framework…

2019-01-20abs ↗pdf ↗