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

3036059081,210 · Jun 202019922001200920172026
48 results for level set estimation (LSE)

Bayesian Neural Networks improve high-dimensional level set estimation.

problem Scalability issue in existing LSE methods for high-dimensional inputs.
method Bayesian Neural Networks with information-based acquisition functions.
result Proposed method achieves better results than state-of-the-art approaches.

New acquisition functions improve Bernoulli LSE.

problem Efficiently estimating regions where a Bernoulli function is above or below a threshold.
method Developed new look-ahead acquisition functions for Gaussian process classification models.
result Demonstrated clear benefits of new acquisition functions on benchmark and real-world tasks.

A novel dose-finding design for cancer clinical trials using level set estimation.

problem Finding the maximum tolerated dose (MTD) in phase I cancer clinical trials.
method Proposes a novel dose-finding design based on level set estimation (LSE) to determine the next dose.
result The proposed LSE design achieves higher accuracy in estimating the MTD and lower risk of overdosing compared to existing designs.

New method improves level set estimation with theoretical guarantees.

problem Efficiently estimating level sets of expensive-to-evaluate functions.
method Randomized straddle algorithm for level set estimation.
result The method provides theoretical guarantees and better practical performance.

Novel LSE estimator improves off-policy learning and evaluation.

problem High variance and poor performance with low-quality propensity scores and heavy-tailed reward distributions.
method Introduces a novel estimator based on the log-sum-exponential (LSE) operator.
result Achieves convergence rate of O(nε/(1+ε))O(n^{-ε/(1+ ε)}) for regret bounds.

We consider the problem of nonparametric regression under shape constraints. The main examples include isotonic regression (with respect to any partial order), unimodal/convex regression, additive shape-restricted regression, and constrained single index model. We review some of the theoretical properties of the least …

2017-09-17abs ↗pdf ↗

Least Squares Estimators are suboptimal for 5D convex functions.

problem Suboptimality of Least Squares Estimators in estimating multidimensional convex functions.
method Analysis of natural subclasses of convex functions in random and fixed design settings.
result Risk of LSE is n2/dn^{-2/d} while minimax risk is n4/(d+4)n^{-4/(d+4)} for d5d \geq 5.

Clustering is concerned with coherently grouping observations without any explicit concept of true groupings. Spectral graph clustering - clustering the vertices of a graph based on their spectral embedding - is commonly approached via K-means (or, more generally, Gaussian mixture model) clustering composed with either…

2018-08-23abs ↗pdf ↗

The study analyzes the performance of a nonparametric estimator for dynamical systems.

problem Analyzing the performance of a nonparametric estimator for dynamical systems.
method Nonparametric least squares estimator (LSE) and information-theoretic methods.
result Rate-optimal error bounds for nonparametric hypotheses classes.

Proposes a differentiable LSE-ICNN for modeling multi-well potentials.

problem Modeling multi-well potentials in various scientific domains.
method Log-sum-exponential (LSE) mixture of input convex neural network (ICNN) modes.
result Smooth surrogate that retains convexity within basins and allows gradient-based learning.

Sharp risk bounds for early-stopping in Gaussian linear regression are derived.

problem Minimizing in-sample mean squared error in high-dimensional Gaussian linear regression.
method Early-stopped mirror descent (ESMD) with local Gaussian width bounds.
result Sharp risk bounds extend to early-stopped mirror descent for least squares estimator (LSE).

Study proposes active learning method for estimating robust regions in uncertain function evaluations.

problem Estimating robust regions for uncertain function evaluations with unknown distributions.
method Distributionally robust level-set estimation (DRPTR) with active learning.
result The proposed method efficiently identifies reliable regions with theoretical guarantees.

Gradient descent on LSE objectives implicitly performs EM, leading to collapse without volume control.

problem Gradient collapse in autoencoders without volume control.
method Introduced a single-layer encoder with an LSE objective and InfoMax regularization for volume control.
result Gradient--responsibility identity holds exactly; LSE alone collapses; variance prevents dead components; decorrelation prevents redundancy.

In this note, we construct new examples of Lorentzian Sasaki-Einstein (LSE) metrics on Smale manifolds M.M. It has already been established in \cite{Gmz2} that such metrics exist on the so-called torsion free Smale manifolds, i.e. the kk-fold connected sum of S2×S3.S^{2}\times S^{3}. Now, we show that LSE metrics exist on…

2013-02-14abs ↗pdf ↗

We propose an improved LASSO estimation technique based on Stein-rule. We shrink classical LASSO estimator using preliminary test, shrinkage, and positive-rule shrinkage principle. Simulation results have been carried out for various configurations of correlation coefficients (rr), size of the parameter vector (ββ), …

2015-03-17abs ↗pdf ↗

Financial markets can be described on several time scales. We use data from the limit order book of the London Stock Exchange (LSE) to compare how the fluctuation dominated microstructure crosses over to a more systematic global behavior.

2007-05-28abs ↗pdf ↗

This paper characterizes and explains the disagreement between two graph embedding methods.

problem Understanding why two popular graph embedding methods produce different results.
method End-to-end analysis of ASE-LSE latent subspaces, proving conditions for agreement and disagreement.
result No maximal-disagreement graph exists; disagreement is strictly below its theoretical ceiling.

Paper presents a robust transfer learning method for active level set estimation.

problem Efficiently identifying regions of a black-box function with limited function evaluations.
method Incorporates prior knowledge from a related function while locally adapting it.
result The method achieves better convergence of level sets compared to standard transfer learning.

The clusters of a distribution are often defined by the connected components of a density level set. However, this definition depends on the user-specified level. We address this issue by proposing a simple, generic algorithm, which uses an almost arbitrary level set estimator to estimate the smallest level at which th…

2014-09-30abs ↗pdf ↗

The paper proposes new cross-correlators using Price's Theorem and piecewise-linear decomposition.

problem Optimal method for estimating cross-correlations using finite samples.
method General mathematical framework using Price's Theorem and piecewise-linear decomposition.
result Some cross-correlators based on Huber's loss functions, MP functions, and LSE functions have higher SNR.

This paper introduces a more efficient method for estimating level sets with a stopping criterion.

problem Efficiently estimating regions where a function exceeds a threshold without exhaustive evaluations.
method Acquisition strategy with a stopping criterion for εε-accurate level set estimation.
result The method satisfies εε-accuracy with a confidence level of 1δ1 - δ and guarantees on lower bounds of performance metrics.

The level set tree approach of Hartigan (1975) provides a probabilistically based and highly interpretable encoding of the clustering behavior of a dataset. By representing the hierarchy of data modes as a dendrogram of the level sets of a density estimator, this approach offers many advantages for exploratory analysis…

2013-07-30abs ↗pdf ↗

In this paper we establish a uniform C2,θC^{2,θ} estimate for level sets of stable solutions to the singularly perturbed Allen-Cahn equation in dimensions n10 n\leq 10 (which is optimal). The proof combines two ingredients: one is the infinite dimensional reduction method which enables us to reduce the C2,θC^{2,θ} estimate …

2018-10-22abs ↗pdf ↗

In this paper, the problem of estimating the level set of a black-box function from noisy and expensive evaluation queries is considered. A new algorithm for this problem in the Bayesian framework with a Gaussian Process (GP) prior is proposed. The proposed algorithm employs a hierarchical sequence of partitions to exp…

2019-02-26abs ↗pdf ↗

Proposes methods for online conformal prediction with nested prediction sets across multiple confidence levels.

problem Need for uncertainty quantification with multiple confidence levels in diverse applications.
method Online optimization perspective to enforce nestedness of prediction sets while controlling quantile estimation error.
result Achieves stable coverage across all levels, strictly nested prediction sets, and improved efficiency.

We study the connections between spectral clustering and the problems of maximum margin clustering, and estimation of the components of level sets of a density function. Specifically, we obtain bounds on the eigenvectors of graph Laplacian matrices in terms of the between cluster separation, and within cluster connecti…

2018-12-16abs ↗pdf ↗

Develops privacy-preserving methods for longitudinal linear regression.

problem Protecting individual information in longitudinal data with privacy-preserving statistics.
method Proposes a user-level private regression estimator and a privatized covariance estimator for longitudinal linear regression under user-level differential privacy.
result Establishes theoretical guarantees for practical user-level differential privacy estimation and inference in longitudinal linear regression.

Adaptive batching improves Gaussian process surrogates for noisy level set estimation.

problem Learning the level set of noisy simulator responses.
method Developed four novel adaptive batching schemes for Gaussian process metamodels.
result Adaptive batching brings significant computational speed-ups with minimal loss of modeling fidelity.

From the stock markets of six countries with high GDP, we study the stock indices, S&P 500 (NYSE, USA), SSE Composite (SSE, China), Nikkei (TSE, Japan), DAX (FSE, Germany), FTSE 100 (LSE, Britain) and NIFTY (NSE, India). The daily mean growth of the stock values is exponential. The daily price fluctuations about the me…

2019-06-30abs ↗pdf ↗

Estimates population mean from user-level data with privacy, accounting for heterogeneity.

problem Heterogeneous user data with varying numbers of data points and distributions.
method Simple model of heterogeneous user data, differential privacy mechanism for estimation.
result Asymptotic optimality of the proposed estimator and general lower bounds on error.

Improves model classification accuracy in black-box settings.

problem Difficulty in inferring model properties due to limited query access.
method Introduces discriminative factorization to distinguish high-quality queries.
result Probability of chance-level classification decreases exponentially with query budget.