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

1122 · Jun 201719922001200920172026
30 results for EB

EB-RANSAC uses energy-based model for robust estimation without complex sampling.

problem Robust estimation of parameters in noisy data.
method EB-RANSAC combines RANSAC's sampling scheme with an energy-based model, simplifying the process and reducing hyperparameter requirements.
result EB-RANSAC effectively solves linear regression and maximum likelihood estimation problems.

We develop an empirical Bayes (EB) algorithm for the matrix completion problems. The EB algorithm is motivated from the singular value shrinkage estimator for matrix means by Efron and Morris (1972). Since the EB algorithm is essentially the EM algorithm applied to a simple model, it does not require heuristic paramete…

2017-06-05abs ↗pdf ↗

Bayesian Empirical Bayes extends EB to complex structures using probabilistic symmetry.

problem Improving simultaneous inference in complex settings like arrays and graphs.
method Generalized empirical Bayes approach based on probabilistic symmetry.
result BEB outperforms existing methods in denoising arrays and spatial data.

Propose an XMSE-aware mixed estimator for EB that interpolates between ML and EB shrinkage.

problem Kernel-based EB estimation may be worse than ML when the kernel is poorly aligned with the true parameter.
method An XMSE-aware mixed estimator that interpolates between ML and EB shrinkage.
result Fixed-weight XMSE is a scalar quadratic, yielding a closed-form oracle mixing weight that is no worse than both ML and the base EB estimator at the XMSE scale.

EB-TCε identifies the best arm with ε confidence in stochastic bandits.

problem Identifying the best arm in stochastic bandits with a fixed level of confidence.
method EB-TCε is a novel sampling rule for ε-best arm identification in stochastic bandits.
result EB-TCε is the first anytime algorithm for fixed confidence or fixed budget identification.

The Normal Means problem plays a fundamental role in many areas of modern high-dimensional statistics, both in theory and practice. And the Empirical Bayes (EB) approach to solving this problem has been shown to be highly effective, again both in theory and practice. However, almost all EB treatments of the Normal Mean…

2018-12-18abs ↗pdf ↗

Effective and intelligent exploration has been an unresolved problem for reinforcement learning. Most contemporary reinforcement learning relies on simple heuristic strategies such as εε-greedy exploration or adding Gaussian noise to actions. These heuristics, however, are unable to intelligently distinguish the well …

2019-06-17abs ↗pdf ↗

EB-PCA reduces noise in high-dimensional PCA by estimating a joint prior distribution.

problem High-dimensional PCA noise in samples comparable to or larger than data.
method Empirical Bayes PCA using Kiefer-Wolfowitz MLE, random matrix theory, and AMP algorithm.
result EB-PCA achieves Bayes-optimal accuracy in spiked models and significantly improves over PCA in simulations and real data.

Empirical Bayes improves causal representation learning across multiple domains.

problem Estimating causal representations from data across multiple domains.
method Developed an EB ff-modeling algorithm for linearly-mixed causal representations.
result Our method achieves more accurate estimation of causal variables than other methods.

Transformer pretraining yields strong EB performance without explicit adaptation.

problem Empirical Bayes problems with unknown test distributions.
method Indirect analysis of pretrained transformer's performance under universal priors.
result Near-optimal regret bound of O~(1n)\widetilde{O}(\frac{1}{n}) for arbitrary test distributions.

EB-VAE combines tumor growth and dropout data for personalized treatment response modeling.

problem Challenges in integrating longitudinal tumor measurements, dropout information, and genetic covariates.
method Extended EB-VAE framework to jointly model longitudinal and time-to-event data, incorporating dropout hazard and genetic covariates.
result Hybrid decoder formulation yields consistent treatment-effect parameters and prior predictive performance comparable to neural decoder.

This paper explores adiabatic solutions of Haydys-Witten equations for knot homology.

problem Investigating instanton Floer homology and its relation to Khovanov homology.
method Analyzes decoupled Haydys-Witten equations and their equivalence to EBE solutions.
result Proposes an equivalence between adiabatic solutions of decoupled Haydys-Witten equations and non-vertical paths in EBE moduli space.

Although exploration in reinforcement learning is well understood from a theoretical point of view, provably correct methods remain impractical. In this paper we study the interplay between exploration and approximation, what we call approximate exploration. Our main goal is to further our theoretical understanding of …

2018-08-29abs ↗pdf ↗

Proposes using external data to improve predictions in medical applications with limited samples.

problem Small sample sizes and complex covariate-response relationships in medical data.
method Integrates external co-data into Bayesian Additive Regression Trees (BART) using an empirical Bayes framework.
result Improves prediction accuracy compared to standard BART, especially for nonlinear relationships.

The betting CI outperforms classical methods in constructing confidence intervals for bounded means.

problem Constructing nonasymptotic confidence intervals for bounded means.
method A betting-based approach to define and time-uniform variants of confidence intervals (CSs).
result The betting CI matches the fundamental limits, outperforming existing empirical Bernstein CIs.

In \cite{Boed}, C.-F. Bödigheimer constructed a finite cell-complex $\mf{Par}_{g,n,m}$ and a bijective map $\cH: \mf{Dip}_{g,n,m} \to \mf{Par}_{g,n,m}$ (the Hilbert-uniformization) from the moduli space of dipole functions on Riemann surfaces with nn directions and mm punctures to $\mf{Par}_{g,n,m}$. In \cite{Boed} a…

2006-01-16abs ↗pdf ↗

A key prerequisite to optimal reasoning under uncertainty in intelligent systems is to start with good class probability estimates. This paper improves on the current best probability estimation trees (Bagged-PETs) and also presents a new ensemble-based algorithm (MOB-ESP). Comparisons are made using several benchmark …

2012-07-11abs ↗pdf ↗

Bayesian predictive inference analyzes a dataset to make predictions about new observations. When a model does not match the data, predictive accuracy suffers. We develop population empirical Bayes (POP-EB), a hierarchical framework that explicitly models the empirical population distribution as part of Bayesian analys…

2014-11-02abs ↗pdf ↗

We investigate the statistical properties of the EBS order book for the EUR/USD and USD/JPY currency pairs and the impact of a ten-fold tick size reduction on its dynamics. A large fraction of limit orders are still placed right at or halfway between the old allowed prices. This generates price barriers where the best …

2013-07-20abs ↗pdf ↗

Minimum numbers of fixed points or of coincidence components (realized by maps in given homotopy classes) are the principal objects of study in topological fixed point and coincidence theory. In this paper we investigate fiberwise analoga and represent a general approach e.g. to the question when two maps can be deform…

2010-02-09abs ↗pdf ↗

In this work we present a novel approach for transfer-guided exploration in reinforcement learning that is inspired by the human tendency to leverage experiences from similar encounters in the past while navigating a new task. Given an optimal policy in a related task-environment, we show that its bisimulation distance…

2019-06-27abs ↗pdf ↗

Efficient Bitwidth Search optimizes neural network quantization for better performance.

problem Finding optimal bitwidth for weights and activations of each layer efficiently.
method EBS algorithm reusing meta weights and binary decomposition for efficient mixed precision convolution.
result Mixed precision QNN outperforms uniform bitwidth and other techniques on CIFAR10 and ImageNet.

PRCD-MAP learns to trust imperfect priors in causal discovery, improving accuracy and robustness.

problem Tackles the brittle trade-off between blind trust and rejection of external priors in causal discovery.
method Proposes PRCD-MAP, a soft prior-consumption layer that assigns per-edge trust to imperfect priors and modulates regularization in a MAP objective.
result Enjoys a population-level safety guarantee and outperforms existing methods on real-world causal discovery tasks.