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

2985958931,190 · Jun 202019922001200920172026
48 results for Non-parametric methods

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.

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.

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 ↗

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

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.

The paper proposes a method to learn the structure of continuous-action games with non-parametric utilities using a limited number of samples.

problem Learning the exact structure of continuous-action games with non-parametric utility functions.
method An 1\ell_1 regularized method that encourages sparsity of the Fourier transform coefficients of the utility functions, accessed via a few Nash equilibria and their noisy utilities.
result The method recovers the exact structure of the utility functions and the game structure with provable theoretical guarantees.

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 ↗

Non-parametric bootstrap improves robust portfolio and trading strategy optimization.

problem Mitigating uncertainty in expected returns and covariances in financial decision-making.
method Non-parametric bootstrap framework for robust optimization without distributional assumptions.
result Improved out-of-sample performance with smoother, more stable results.

Methodology for estimating marked Hawkes processes with neural networks.

problem Estimating conditional intensity of marked Hawkes processes.
method Proposes two models: Shallow Neural Hawkes with marks and Neural Network for Non-Linear Hawkes with Marks.
result Validation on synthetic datasets and real-world cryptocurrency order book data.

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.

Paper proposes a machine learning-based method for estimating mediation effects.

problem Challenges in estimating mediation effects with multiple, continuous mediators.
method Developed a one-step estimation algorithm using machine learning and Riesz learning.
result Proposed method can estimate mediation effects from just two statistical estimands.

Paper relaxes assumptions for non-parametric estimation in pairwise learning.

problem Generalization performance of non-parametric estimation for pairwise learning.
method Significantly relaxes restrictive assumptions, constructs structured deep ReLU neural network, and designs targeted hypothesis space.
result Establishes a sharp oracle inequality for empirical minimizer with general hypothesis space for Lipschitz continuous pairwise losses.

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.

Paper proposes a new time series prediction method using weighted past data and optimization.

problem Predicting time series data with improved accuracy considering both deterministic and stochastic assumptions.
method The approach uses a weighted sum of past data, solving a constrained linear optimization problem to minimize an outer bound of prediction error.
result The method can outperform existing non-parametric methods in short-term forecasts.

Study non-parametric value function estimation from a single path.

problem Estimating value function from a single trajectory in Markov reward processes.
method Kernel-based multi-step temporal difference (TD) estimates, including KK-step look-ahead TD and TD(λ)(λ).
result Non-asymptotic guarantees for TD estimates, capturing interactions between mixing time and model mis-specification.

Accurate calibration of probabilistic predictive models learned is critical for many practical prediction and decision-making tasks. There are two main categories of methods for building calibrated classifiers. One approach is to develop methods for learning probabilistic models that are well-calibrated, ab initio. The…

2014-01-14abs ↗pdf ↗

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.

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 ↗

DiD-BCF model improves causal inference in panel data with robust non-parametric methods.

problem Challenges in Difference-in-Differences (DiD) estimation, especially heterogeneous treatment effects and non-linearities.
method Difference-in-Differences Bayesian Causal Forest (DiD-BCF) with PTA-based reparameterization.
result DiD-BCF provides superior performance and uncovers significant heterogeneity in treatment effects.

Kernel ridge regression (KRR) is a standard method for performing non-parametric regression over reproducing kernel Hilbert spaces. Given nn samples, the time and space complexity of computing the KRR estimate scale as O(n3)\mathcal{O}(n^3) and O(n2)\mathcal{O}(n^2) respectively, and so is prohibitive in many cases. We prop…

2015-01-25abs ↗pdf ↗

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 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.

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.

Method recovers causal diffusion mechanisms from steady-state data without parametric assumptions.

problem Recovering causal diffusion mechanisms from steady-state gene expression data.
method Non-parametric kernel estimator for drift function, cross-validation for hyperparameter tuning.
result Full causal mechanism can be non-parametrically identified under weak non-explosion criterion.

Develops non-parametric tests for group symmetry in data.

problem Lack of statistical tests for group symmetry in data.
method Formulates and implements non-parametric tests for distributional symmetry under specified groups.
result Develops tests for conditional invariance/equivariance and applies them to real-world data.