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

8.6%17.1%25.7%34.3% · Jun 202019922001200920172026
48 results for Bayesian Point-wise Optimization

New methods estimate point-wise dependency from neural MI models.

problem Estimating point-wise dependency between different events.
method Developed two methods: Probabilistic Classifier and Density-Ratio Fitting.
result Demonstrated effectiveness in MI estimation, self-supervised representation learning, and cross-modal retrieval.

Unified notation simplifies information-theoretic concepts in machine learning.

problem Opaque notation for information-theoretic quantities in machine learning.
method Proposed a practical and unified notation for information-theoretic quantities.
result Unified notation facilitates new intuitions and rederivations in machine learning.

This paper develops a novel stochastic tree ensemble method for nonlinear regression, which we refer to as XBART, short for Accelerated Bayesian Additive Regression Trees. By combining regularization and stochastic search strategies from Bayesian modeling with computationally efficient techniques from recursive partiti…

2020-02-09abs ↗pdf ↗

The intention of this paper is to estimate a Bayesian distribution-free chain ladder (DFCL) model using approximate Bayesian computation (ABC) methodology. We demonstrate how to estimate quantities of interest in claims reserving and compare the estimates to those obtained from classical and credibility approaches. In …

2010-04-15abs ↗pdf ↗

We consider the classical optimal dividends problem under the Cramér-Lundberg model with exponential claim sizes subject to a constraint on the time of ruin. We introduce the dual problem and show that the complementary slackness conditions are satisfied, thus there is no duality gap. Therefore the optimal value functi…

2014-10-14abs ↗pdf ↗

Many applications require the ability to judge uncertainty of time-series forecasts. Uncertainty is often specified as point-wise error bars around a mean or median forecast. Due to temporal dependencies, such a method obscures some information. We would ideally have a way to query the posterior probability of the enti…

2012-11-13abs ↗pdf ↗

New algorithm improves Bayesian neural networks using adaptive importance sampling.

problem High computational cost in training Bayesian neural networks.
method Adaptive Importance Sampling (AIS) integrated into a novel algorithm (PMCnet).
result Improved performance and exploration capabilities for both shallow and deep neural networks.

The recent developments of basis pursuit and compressed sensing seek to extract information from as few samples as possible. In such applications, since the number of samples is restricted, one should deploy the sampling points wisely. We are motivated to study the optimal distribution of finite sampling points. Formul…

2012-07-25abs ↗pdf ↗

Adapts BP-based algorithms for deep learning, improving performance and accuracy.

problem Training deep neural networks with discrete weights and activations.
method Message-passing algorithms based on Belief Propagation, with reinforcement field.
result Comparable performance to SGD-inspired heuristics (BinaryNet) and higher accuracy in predictions.

CNR uses convex optimization to estimate conditional distributions.

problem Estimating uncertainty in predictions and posterior conditional distributions.
method Convex optimization of a posterior defined via non-linear transformations on Gaussians.
result CNR can fit arbitrary conditional distributions, including multimodal and non-symmetric ones.

By using certain idea developed in minimal submanifold theory we study rigidity problem for self-shrinkers in the present paper. We prove rigidity results for squared norm of the second fundamental form of self-shrinkers, either under point-wise conditions or under integral conditions.

2011-05-25abs ↗pdf ↗

PACMAN provides bounds for classification tasks considering accuracy vs. negative log-loss mismatch.

problem Mismatch between accuracy and negative log-loss in classification tasks.
method Point-wise PAC approach over generalization gap, using likelihood ratio and concentration inequalities.
result PACMAN provides point-wise PAC bounds for the generalization problem.

Computational topology is a vibrant contemporary subfield and this article integrates knot theory and mathematical visualization. Previous work on computer graphics developed a sequence of smooth knots that were shown to converge point wise to a piecewise linear (PL) approximant. This is extended to isotopic convergenc…

2016-03-28abs ↗pdf ↗

A deep reinforcement learning approach for slate re-ranking in e-commerce.

problem Improving user satisfaction in e-commerce by optimizing the ranking of items in a slate.
method Generator and Critic approach, using reinforcement learning and a Full Slate Critic model.
result The Generator and Critic approach significantly outperforms existing methods in slate evaluation and efficiency.

New method for accurate uncertainty estimation in deep learning predictions.

problem Insufficient methods for assessing prediction uncertainty in deep learning.
method Valid non-parametric bootstrap method for deep neural networks.
result Accurate confidence intervals and simultaneous confidence bands for survival data.

Develops unbiased estimation method using underdamped Langevin dynamics.

problem Estimating expectations of non-negative Lebesgue density probability measures.
method Underdamped Langevin dynamics, time-discretized versions, doubly randomized estimation.
result Proves finite variance and expected/finite cost of the proposed estimator.

Many applications that use empirically estimated functions face a curse of dimensionality, because the integrals over most function classes must be approximated by sampling. This paper introduces a novel regression-algorithm that learns linear factored functions (LFF). This class of functions has structural properties …

2014-12-19abs ↗pdf ↗

DiFF-RF detects point-wise and collective anomalies using random partitioning trees.

problem Detecting anomalies in data, especially collective anomalies.
method Random partitioning binary trees with distance-based leaves and semi-supervised learning.
result DiFF-RF significantly outperforms isolation forest and one-class SVM.

We derive point-wise and integral rigidity/gap results for a closed manifold with harmonic Weyl curvature in any dimension. In particular, there is a generalization of Tachibana's theorem for non-negative curvature operator. The key ingredients are new Bochner-Weitzenböck-Lichnerowicz type formulas for the Weyl tensor,…

2016-02-03abs ↗pdf ↗

We study some basic problems of translating solitons: the volume growth, generalized maximum principle, Gauss maps and certain functions related to the Gauss maps, finally we carry out point-wise estimates and integral estimates for the squared norm of the second fundamental form. Those estimates give rigidity theorems…

2014-10-19abs ↗pdf ↗

We present a new implementation of anisotropic mean curvature flow for contour recognition. Our procedure couples the mean curvature flow of planar closed smooth curves, with an external field from a potential of point-wise charges. This coupling constrains the motion when the curve matches a picture placed as backgrou…

2018-03-10abs ↗pdf ↗

We study the Stochastic Gradient Langevin Dynamics (SGLD) algorithm for non-convex optimization. The algorithm performs stochastic gradient descent, where in each step it injects appropriately scaled Gaussian noise to the update. We analyze the algorithm's hitting time to an arbitrary subset of the parameter space. Two…

2017-02-18abs ↗pdf ↗

Proposes CCE to assess point-wise reliability of neural network predictions.

problem Overconfidence and misaligned predictive distributions in neural networks.
method Introduces Conditional Congruence (CCE) metric using conditional kernel mean embeddings.
result CCE exhibits correctness, monotonicity, reliability, and robustness in high-dimensional regression tasks.

This paper simplifies conditional Sobol' indices calculation using PCE bases.

problem Computational inefficiency and lack of consistency in evaluating conditional Sobol' indices.
method Analytical extraction of conditional Sobol' indices via basis decomposition of PCE expansions.
result Derives closed-form expressions for conditional Sobol' indices.

We present a comprehensive theory of homogeneous volatility (and variance) estimators of arbitrary stochastic processes that fully exploit the OHLC (open, high, low, close) prices. For this, we develop the theory of most efficient point-wise homogeneous OHLC volatility estimators, valid for any price processes. We intr…

2009-08-12abs ↗pdf ↗

In order to alleviate data sparsity and overfitting problems in maximum likelihood estimation (MLE) for sequence prediction tasks, we propose the Generative Bridging Network (GBN), in which a novel bridge module is introduced to assist the training of the sequence prediction model (the generator network). Unlike MLE di…

2017-06-28abs ↗pdf ↗

Bayesian optimization with cost-awareness using Gittins index.

problem Optimizing unknown functions with limited data evaluations and costs.
method Developed a connection between cost-aware Bayesian optimization and the Pandora's Box problem, using the Gittins index as an acquisition function.
result The Gittins index-based acquisition function performs well in cost-aware Bayesian optimization, especially in high dimensions.

SCoreBO improves Bayesian optimization by learning hyperparameters and self-correcting.

problem Efficient hyperparameter tuning for Gaussian process models in Bayesian optimization.
method Introduces SAL and SCoreBO, which prioritize hyperparameter learning and perform simultaneous optimization and learning.
result SCoreBO outperforms state-of-the-art methods on traditional benchmarks and atypical tasks.

When hyperparameter optimization of a machine learning algorithm is repeated for multiple datasets it is possible to transfer knowledge to an optimization run on a new dataset. We develop a new hyperparameter-free ensemble model for Bayesian optimization that is a generalization of two existing transfer learning extens…

2018-02-06abs ↗pdf ↗