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

Trend · papers per month

118236354472 · Jun 202019922001200920172026
48 results for set-membership estimation

Paper revisits set membership estimation for linear systems with relaxed disturbance bounds.

problem Set membership estimation for linear systems with disturbances bounded by convex sets.
method Adopted block-martingale small-ball condition and random perturbed control policies to establish convergence rates.
result Established convergence rates for disturbances bounded by general convex sets.

Paper reduces sample complexity for bilinear systems identification to nearly constant.

problem Identifying discrete-time bilinear systems under bounded disturbances.
method Uses trajectory-dependent regressors and polynomial mean-square state growth analysis.
result Proves sample complexity of O~(1/ε)\widetilde{\mathcal O}(1/ε) for estimation error εε.

In this paper we explore the "vector semantics" problem from the perspective of "almost orthogonal" property of high-dimensional random vectors. We show that this intriguing property can be used to "memorize" random vectors by simply adding them, and we provide an efficient probabilistic solution to the set membership …

2018-02-23abs ↗pdf ↗

This note is a response to [7] in which it is claimed that [13, Proposition 11] is false. We demonstrate here that this assertion in [7] is false, and is based on a misreading of the notion of set membership in [13, Proposition 11]. We maintain that [13, Proposition 11] is true. ([7] = arXiv:1809.00593, [13] = arXiv:15…

2018-09-06abs ↗pdf ↗

Adaptive filters are applied in several electronic and communication devices like smartphones, advanced headphones, DSP chips, smart antenna, and teleconference systems. Also, they have application in many areas such as system identification, channel equalization, noise reduction, echo cancellation, interference cancel…

2019-09-06abs ↗pdf ↗

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.

Develops a method to estimate policy values robustly in the presence of confounding variables.

problem Infinite-horizon reinforcement learning with unobserved confounding variables makes policy evaluation unidentifiable.
method Robust approach estimating sharp bounds on policy value using optimization over state-occupancy ratios and sensitivity model.
result Proves convergence to sharp bounds as more confounded data is collected.

Techniques known as Nonlinear Set Membership prediction, Kinky Inference or Lipschitz Interpolation are fast and numerically robust approaches to nonparametric machine learning that have been proposed to be utilised in the context of system identification and learning-based control. They utilise presupposed Lipschitz p…

2017-02-28abs ↗pdf ↗

There has been a recent trend in training neural networks to replace data structures that have been crafted by hand, with an aim for faster execution, better accuracy, or greater compression. In this setting, a neural data structure is instantiated by training a network over many epochs of its inputs until convergence.…

2019-06-10abs ↗pdf ↗

New method uses entropy dissipation to prove isoperimetric inequalities.

problem Proving isoperimetric inequalities in geometric settings.
method Information-theoretic approach based on entropy dissipation under heat flow.
result New proof of Euclidean isoperimetric inequality with sharp constant.

In the last decade, a considerable research effort has been devoted to developing adaptive algorithms based on kernel functions. One of the main features of these algorithms is that they form a family of universal approximation techniques, solving problems with nonlinearities elegantly. In this paper, we present data-s…

2018-08-15abs ↗pdf ↗

In unsupervised learning, dimensionality reduction is an important tool for data exploration and visualization. Because these aims are typically open-ended, it can be useful to frame the problem as looking for patterns that are enriched in one dataset relative to another. These pairs of datasets occur commonly, for ins…

2018-11-14abs ↗pdf ↗

privGAN protects synthetic data from membership inference attacks.

problem Membership inference attacks on synthetic data generated by GANs.
method Developed a new GAN architecture (privGAN) that not only generates synthetic data but also defends against membership inference attacks.
result privGAN provides protection against membership inference attacks without significantly compromising downstream performance.

New estimators outperform maximum likelihood without hyper-parameter estimation.

problem Improving system identification performance without hyper-parameter estimation.
method Developed generalized Bayes and closed-form biased estimators using excess MSE.
result New estimators have comparable performance to empirical-Bayes-based regularized estimator.

New framework converts offline to online estimation using black-box offline estimators.

problem Convert offline estimation algorithms to online estimation algorithms.
method Oracle-Efficient Online Estimation (OEOE) framework.
result Achieves near-optimal online estimation error via black-box offline estimators.

New estimator reduces variance in discrete random variables.

problem Estimating gradients for discrete random variables with reduced variance.
method Sampling without replacement and Rao-Blackwellization.
result Our estimator is the most consistent gradient estimator across different entropy settings.

SCOPE estimator improves covariance and precision matrix estimation.

problem Estimating covariance and precision matrices accurately.
method Distributionally robust optimization with convex spectral divergence.
result SCOPE estimator reduces spectral bias and improves condition number.

We present a multi-task learning approach to jointly estimate the means of multiple independent data sets. The proposed multi-task averaging (MTA) algorithm results in a convex combination of the single-task maximum likelihood estimates. We derive the optimal minimum risk estimator and the minimax estimator, and show t…

2011-07-21abs ↗pdf ↗

Obtaining more accurate equity value estimates is the starting point for stock selection, value-based indexing in a noisy market, and beating benchmark indices through tactical style rotation. Unfortunately, discounted cash flow, method of comparables, and fundamental analysis typically yield discrepant valuation estim…

2007-07-24abs ↗pdf ↗

The maximum mean discrepancy (MMD) is a kernel-based distance between probability distributions useful in many applications (Gretton et al. 2012), bearing a simple estimator with pleasing computational and statistical properties. Being able to efficiently estimate the variance of this estimator is very helpful to vario…

2019-06-05abs ↗pdf ↗

Stochastic volatility modelling of financial processes has become increasingly popular. The proposed models usually contain a stationary volatility process. We will motivate and review several nonparametric methods for estimation of the density of the volatility process. Both models based on discretely sampled continuo…

2009-10-27abs ↗pdf ↗

This paper reviews SDR methods for multivariate response regression.

problem Handling sufficient dimension reduction for multivariate response regression.
method Characterizes SDR estimators as inverse or forward regression methods.
result Pooled marginal, projective resampling, distance-based, ordinary least squares, partial least squares, and semiparametric SDR estimators are discussed.

Density ratio estimation is a vital tool in both machine learning and statistical community. However, due to the unbounded nature of density ratio, the estimation procedure can be vulnerable to corrupted data points, which often pushes the estimated ratio toward infinity. In this paper, we present a robust estimator wh…

2017-03-09abs ↗pdf ↗

TAKDE optimizes kernel density estimation for real-time dynamic processes.

problem Real-time density estimation in applications like computer vision and signal processing.
method Derives asymptotic mean integrated squared error (AMISE) upper bound for 'sliding window' kernel density estimator and proposes TAKDE as a novel, theoretically optimal estimator.
result TAKDE outperforms other dynamic density estimators in terms of test log-likelihood and runtime.

We introduce two new estimators of the bivariate Hurst exponent in the power-law cross-correlations setting -- the cross-periodogram and local XX-Whittle estimators -- as generalizations of their univariate counterparts. As the spectrum-based estimators are dependent on a part of the spectrum taken into consideration …

2014-08-28abs ↗pdf ↗

New method for fast volatility estimation robust to change points.

problem Robust high-frequency volatility estimation with change points.
method ℓ1-regularized power variation estimators using LARS for sparse estimation and dynamic programming for change point refinement.
result Minimax rates achieved for volatility estimators, providing accurate and smooth forecasts.

ROME improves density estimation for multi-modal, non-normal data.

problem Robust multi-modal density estimation in non-normal, highly correlated distributions.
method ROME uses clustering to segment multi-modal data into uni-modal clusters, then combines KDE estimates for each cluster.
result ROME outperforms state-of-the-art methods and is more robust to various distributions.

Private estimation of many quantiles using differential privacy.

problem Estimating quantiles of a distribution privately.
method Two approaches: 1) Private estimation of empirical quantiles, 2) Uniform density estimation.
result There is a tradeoff between estimating quantiles at specific points and uniformly estimating the quantile function.

Paper proposes robust LAD estimators for 2D sinusoidal model, proving consistency and normality.

problem Estimation of parameters in 2D sinusoidal models with outliers or heavy-tailed noise.
method Least absolute deviation (LAD) estimators for robust parameter estimation.
result Strong consistency and asymptotic normality of LAD estimators for 2D sinusoidal model parameters.

Optimal and safe semi-supervised learning estimator for high-dimensional data.

problem Improving regression parameter estimation with unlabeled data in high-dimensional settings.
method Established minimax lower bound, proposed optimal and safe semi-supervised estimators.
result Optimal semi-supervised estimator achieves the minimax lower bound.

Estimating boundaries from point clouds with improved accuracy and rigorous error estimates.

problem Identifying the boundary of a domain from point cloud samples.
method Developed new estimators for normal vectors, distances, and boundary tests; provided error estimates.
result Efficient and accurate estimators for boundary properties on point clouds.