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

Trend · papers per month

7142128 · Jun 202019922001200920172026
48 results for Non-Parametric

Proposes method for eliciting non-parametric joint priors using normalizing flows.

problem Learning complex non-parametric joint priors for model parameters.
method Expert elicitation combined with normalizing flows for generative modeling.
result Framework supports elicitation of both parametric and non-parametric priors.

NPOD algorithm improves efficiency in estimating pharmacokinetic parameters.

problem Efficiently estimating joint distribution of model parameters in population pharmacokinetics.
method Uses gradient approach to suggest new support points, reducing evaluation time.
result Achieves similar solutions to NPAG but with significantly fewer cycles and runtime.

Modeling structure in complex networks using Bayesian non-parametrics makes it possible to specify flexible model structures and infer the adequate model complexity from the observed data. This paper provides a gentle introduction to non-parametric Bayesian modeling of complex networks: Using an infinite mixture model …

2013-12-20abs ↗pdf ↗

This study examines when non-parametric methods are robust to adversarial examples.

problem Understanding when non-parametric methods are robust to adversarial examples.
method Examined general non-parametric methods and established conditions for r-consistency.
result Non-parametric methods like nearest neighbors and kernel classifiers are r-consistent when data is well-separated, while histograms are not.

Simpler GNNs with low-rank non-parametric aggregators perform well on graph benchmarks.

problem Over-engineering in GNN architectures for common semi-supervised node classification datasets.
method Replacing feature aggregation with a non-parametric learner to streamline GNN design.
result Non-parametric regression is effective for semi-supervised learning on sparse, directed networks.

Study provides guarantees for kernel clustering under non-parametric mixtures.

problem Statistical guarantees for kernel-based clustering without strong assumptions.
method Non-parametric mixture models, kernel-based clustering, consistency guarantees.
result Necessary and sufficient separability conditions for consistent clustering recovery.

Develops flexible non-parametric ACFs using B-spline kernels.

problem Flexible modelling of the autocovariance function (ACF) in time-series, spatial, and spatio-temporal analysis.
method Derives the inverse Fourier transform of B-spline spectral bases to create a general class of non-parametric ACFs.
result Provides a provably dense, flexible, and general class of non-parametric ACFs for various types of processes.

Study evaluates policies in partially observable environments without full model specification.

problem Evaluating policies in partially observable environments without full model specification.
method Developed non-parametric identification and recursive fitted-Q-evaluation algorithm.
result Established finite-sample error bounds for policy value estimation.

Non-parametric estimators improve quickest changepoint detection under irregular sequence lengths.

problem Limited and irregular sequence lengths hinder application of ARL and ADD in QCD.
method Analogies with survival analysis to model detection probabilities under truncation.
result KM-ARL and KM-ADD non-parametric estimators are asymptotically unbiased.

Estimates non-parametric logistic model using case-control data and external summary info.

problem Imbalanced binary data in case-control studies.
method Two-step estimation procedure with deep neural network for functional approximation.
result Proposed estimator achieves optimal convergence rate in non-parametric regression.

DPPS uses DP priors for Bayesian non-parametric multi-arm bandits.

problem Optimizing multi-arm bandit environments with prior beliefs.
method Bayesian non-parametric algorithm based on Dirichlet Process priors.
result DPPS provides principled incorporation of prior beliefs and is optimal in Bayesian regret setup.

Develops a new method for learning non-parametric DAGs using RKHS.

problem Challenges of learning non-parametric causal models with large combinatorial search space.
method Uses reproducing kernel Hilbert spaces (RKHS) and sparsity-inducing regularization terms based on partial derivatives to enforce acyclicity.
result Shows improved performance through simulations and data analyses.

The paper develops a theory for identifying the best arm in non-parametric multi-armed bandits with a fixed budget.

problem Identifying the best arm in non-parametric multi-armed bandits with a limited number of trials.
method The paper proposes upper and lower bounds on the average log-probability of misidentification using information-theoretic quantities and a refined analysis of the successive-rejects strategy.
result The paper provides new upper and lower bounds on the average log-probability of misidentification, which generalize existing bounds.

The paper reviews methods for estimating individual treatment effects using non-parametric regression models.

problem Estimating heterogeneous treatment effects in observational data.
method Non-parametric regression models to estimate individual treatment effects.
result A review and development of existing state-of-the-art frameworks for individual treatment effects estimation.

Estimates neural drift for stochastic equations, improving inference on noisy data.

problem Estimating drift in stochastic differential equations with neural networks.
method Non-parametric estimation using ReLU neural networks, enforcing theoretical bounds.
result Practical method for inference on noisy and rough functional data.

New algorithm learns nonlinear phenomena from noisy local measurements without data exchange.

problem Learning nonlinear phenomena from noisy local measurements in a decentralized network.
method Non-parametric learning algorithm that spreads information only between neighboring nodes.
result Non-asymptotic estimation error bounds for the proposed method.

We propose a method for learning Markov network structures for continuous data without invoking any assumptions about the distribution of the variables. The method makes use of previous work on a non-parametric estimator for mutual information which is used to create a non-parametric test for multivariate conditional i…

2017-08-08abs ↗pdf ↗

Bayesian econometrics improves nowcasting during pandemics.

problem Improving nowcasting during extreme economic events like pandemics.
method Bayesian econometric methods using non-parametric mixed frequency VARs with additive regression trees.
result Significant improvements in nowcasting performance compared to linear models.

Study compares non-parametric models for predicting medical insurance reimbursement delays.

problem Estimating the time-lapse between medical insurance reimbursement.
method Comparative study of four non-parametric regression models (KNNs, SVMs, Decision Trees, Random Forests) using R-squared metric.
result Each model's performance varies with training data size, feature space, and hyperparameters.

This paper finds a unique partition of a sample space for estimating continuous distributions.

problem Estimating continuous probability distributions from finite samples.
method Equal-probability partition of the sample space using order statistics.
result The partition yields an entropy of log2(N+1) bits, providing a discrete entropy estimate.

New estimator robust to adversarial noise and data heterogeneity.

problem Sensitive to adversarial noise and poor performance with heterogeneous data.
method Distributionally robust estimator minimizing worst-case conditional expected loss over adversarial distributions.
result Efficiently finds non-parametric local estimates via convex optimization.

We present a non-parametric Bayesian approach to structure learning with hidden causes. Previous Bayesian treatments of this problem define a prior over the number of hidden causes and use algorithms such as reversible jump Markov chain Monte Carlo to move between solutions. In contrast, we assume that the number of hi…

2012-06-27abs ↗pdf ↗

BN^2MF identifies unknown exposure patterns in environmental mixtures.

problem Identifying unknown exposure patterns in environmental mixtures.
method Bayesian non-parametric non-negative matrix factorization (BN^2MF) with non-negative continuous priors and a non-parametric sparse prior.
result Estimates patterns of chemical exposures without specifying the number of patterns.

Paper introduces an online method for estimating the difference between two probability distributions.

problem Estimating the difference between two probability density functions using available data.
method Non-parametric online likelihood-ratio estimation using Pearson-divergence functional minimization.
result The proposed method provides efficient online updates and theoretical guarantees for performance.

iCOS method estimates risk-neutral densities and option prices without model assumptions.

problem Estimating risk-neutral densities and option prices without model assumptions.
method Leverages Fourier-cosine technique using option-implied cosine series coefficients, without model assumptions.
result Effective in extracting information from option prices under various market conditions.

The paper improves prediction intervals for non-parametric regression using histograms.

problem Computing accurate prediction intervals for non-parametric regression models.
method Uses conditional histograms to estimate conditional distributions and compute shortest prediction intervals.
result The method provides prediction intervals with provable marginal coverage and asymptotic conditional coverage.

New algorithm reduces dynamic regret for noisy gradient feedback with piecewise polynomial comparators.

problem Online estimation of piecewise polynomial trends with noisy feedback.
method Introduces variational constraint for piecewise polynomial comparators, designs adaptive algorithm.
result Achieves nearly optimal dynamic regret of $ ilde{O}(n^{ rac{1}{2k+3}}C_n^{ rac{2}{2k+3}})$.

Paper proposes a neural network for non-parametric Hawkes process kernel estimation.

problem Estimating non-parametric Hawkes process kernels efficiently and interpretably.
method Single hidden layer neural network for unbiased log-likelihood estimation of Hawkes processes.
result Proposed neural network achieves comparable or better performance than existing methods.

The paper provides theoretical guarantees for transformation-based models in variational inference.

problem Theoretical justification for transformation-based models in variational inference.
method Theoretical analysis of non-linear latent variable models and Gaussian process priors.
result Theoretical guarantees for implicit variational inference, achieving optimal risk bounds and approximating the true posterior.

This work develops a non-parametric test for relational independence in non-i.i.d. data.

problem Testing independence in relational systems where data samples are not i.i.d.
method Kernel mean embedding for relational variables, consistent non-parametric scalable kernel test.
result Empirically validated effectiveness compared to state-of-the-art tests.

Near-optimal tests and confidence sequences for non-parametric data.

problem Flexible statistical inference and decision-making with non-parametric data.
method Classic delayed-start normal-mixture sequential probability ratio tests with asymptotic guarantees.
result Asymptotically optimal type-I error and expected rejection time guarantees.

KQT-EWMA monitors multivariate data streams online with flexible and practical change detection.

problem Online monitoring of multivariate data streams for detecting changes.
method Combines Kernel-QuantTree histogram and EWMA statistic for non-parametric monitoring.
result Controls Average Run Length (ARL0) while achieving comparable detection delays.

The article applies Occam's Razor to non-parametric model building, minimizing the number of bits for data encoding.

problem Overlooking the role of model parameters in data encoding leads to inefficient probability density estimators.
method Extends bit counting to model parameters, providing a true measure of complexity for parametric models.
result Minimizing total bit requirement leads to smoother, more efficient probability density estimates and fewer relevant parameters.

We propose a new non parametric technique to estimate the CALL function based on the superhedging principle. Our approach does not require absence of arbitrage and easily accommodates bid/ask spreads and other market imperfections. We prove some optimal statistical properties of our estimates. As an application we firs…

2015-02-13abs ↗pdf ↗

This article reviews the Author-Topic Model and presents a new non-parametric extension based on the Hierarchical Dirichlet Process. The extension is especially suitable when no prior information about the number of components necessary is available. A blocked Gibbs sampler is described and focus put on staying as clos…

2012-11-27abs ↗pdf ↗

Estimates conditional Brenier maps using entropic optimal transport.

problem Non-parametric estimation of conditional Brenier maps.
method Entropic optimal transport for scalable non-parametric estimation.
result Entropic optimal transport maps asymptotically converge to conditional Brenier maps.

In this paper, we propose the exponential Levy neural network (ELNN) for option pricing, which is a new non-parametric exponential Levy model using artificial neural networks (ANN). The ELNN fully integrates the ANNs with the exponential Levy model, a conventional pricing model. So, the ELNN can improve ANN-based model…

2018-02-19abs ↗pdf ↗