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

Trend · papers per month

6.3%12.5%18.8%25.0% · Oct 199319922001200920172026
48 results for parametric analysis

Paper compares different models for time-to-event analysis.

problem Comparing models for time-to-event analysis.
method Experimental comparison of semi-parametric, parametric, and machine learning models.
result Models' performance evaluated using concordance index.

Semi-parametric survival analysis methods like the Cox Proportional Hazards (CPH) regression (Cox, 1972) are a popular approach for survival analysis. These methods involve fitting of the log-proportional hazard as a function of the covariates and are convenient as they do not require estimation of the baseline hazard …

2019-05-14abs ↗pdf ↗

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.

New method for decomposing high-dimensional parametric domains using PCA and inverse projection.

problem Decomposing high-dimensional parametric domains efficiently.
method Iterative Principal Component Analysis (PCA) and inverse projection methods.
result The proposed method effectively reconstructs the original domain from lower-dimensional data.

Compressive learning framework adapted for semi-parametric models.

problem Handling large datasets efficiently with semi-parametric models.
method Reformulate compressive learning framework to handle semi-parametric models, capturing their inherent topology and structure.
result Demonstrated robustness and efficiency of the framework in independent component analysis and subspace clustering.

TabSurv adapts tabular neural networks for survival analysis.

problem Survival analysis on tabular data using deep learning methods.
method Adapts modern tabular architectures to survival analysis using Weibull distribution or non-parametric prediction. Optimizes SurvHL histogram loss function.
result TabSurv consistently outperforms classical and deep learning baselines on 10 real-world survival datasets.

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.

SurvMixClust clusters survival data and predicts individual survival curves.

problem Integrating clustering into survival analysis for precision medicine.
method SurvMixClust learns latent representations for clustering and predicts survival functions using a mixture of non-parametric experts.
result SurvMixClust creates balanced clusters with distinct survival curves, outperforming clustering baselines and competing with non-clustering models in predictive accuracy.

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.

Optimizes predictions for specific tasks using parametrized decision analysis.

problem Optimizing predictions for specific decision tasks of interest.
method Designs a class of parametrized actions for Bayesian decision analysis.
result Derives efficient and interpretable solutions for various action parametrizations and loss functions.

This paper refines the weighted strategy for non-stationary parametric bandits and MDPs, improving regret bounds.

problem Non-stationary environments with gradual drifting patterns.
method Refined analysis framework for the weighted strategy, leading to simpler and more efficient algorithms.
result Improved regret bounds for linear bandits, generalized linear bandits, and self-concordant bandits.

Bayesian model tackles spatial count data issues with flexible non-parametric techniques.

problem Challenges in traditional parametric models for spatial count data with unbalanced distributions and complex dependencies.
method Bayesian semi-parametric spatial dispersed count model combining non-parametric techniques and adapted count models.
result Demonstrates superior performance in managing dispersion and capturing intricate spatial patterns.

This paper refines the weighted strategy for non-stationary parametric bandits, improving regret bounds.

problem Non-stationary environments with gradual drifting patterns.
method Refined analysis framework for the weighted strategy in linear and generalized linear bandits.
result A simpler weight-based algorithm with improved regret bounds compared to previous studies.

We derive upper bounds on the complexity of ReLU neural networks approximating the solution maps of parametric partial differential equations. In particular, without any knowledge of its concrete shape, we use the inherent low-dimensionality of the solution manifold to obtain approximation rates which are significantly…

2019-03-31abs ↗pdf ↗

We introduce a semi-parametric Bayesian model for survival analysis. The model is centred on a parametric baseline hazard, and uses a Gaussian process to model variations away from it nonparametrically, as well as dependence on covariates. As opposed to many other methods in survival analysis, our framework does not im…

2016-11-02abs ↗pdf ↗

Improved spatial distribution learning with Bayesian transport maps and parametric shrinkage.

problem Learning non-Gaussian spatial distributions with limited training data.
method Proposed ShrinkTM approach using Bayesian transport maps with parametric shrinkage.
result ShrinkTM outperforms existing BTM, especially with few training samples.

High dimensional sparse learning has imposed a great computational challenge to large scale data analysis. In this paper, we are interested in a broad class of sparse learning approaches formulated as linear programs parametrized by a {\em regularization factor}, and solve them by the parametric simplex method (PSM). O…

2017-04-04abs ↗pdf ↗

PERCEPT detects changes in high-dimensional data streams using topological data analysis.

problem Detecting changes in high-dimensional data streams, especially when embedded in a low-dimensional space.
method Leverages topological data analysis to learn embedded topology as a point cloud via persistence diagrams, then applies non-parametric monitoring for detecting changes.
result Demonstrates efficient detection of online changes from high-dimensional data streams.

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.

BSD is a Bayesian framework for analyzing neural spectral data.

problem Challenges in statistical analysis and group-level comparisons of neural power spectra.
method Bayesian Spectral Decomposition (BSD) for parametric models of neural spectra.
result BSD outperforms existing methods in model selection and parameter 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 method improves Bayesian inference for parametric models, robust to misspecification.

problem Inference can be untrustworthy when parametric models are wrong.
method Adaptive nonparametric corrections for parametric Bayesian models using generalized Bayes.
result The method achieves robustness and efficiency, converging fast when the parametric model is close to true.

Bayesian methods improve causal effect estimation, offering shrinkage and sensitivity analysis.

problem Improving causal effect estimation in practical settings.
method Parametric and nonparametric Bayesian approaches.
result Priors induce shrinkage and sparsity in parametric models.

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.

New analysis shows optimal embedding learning rate depends on vocabulary size, not just model width.

problem Optimal learning rate for language model embeddings is not well understood, especially with large vocabularies.
method Theoretical analysis of training dynamics, interpolation between μμP and LV regimes.
result Optimal embedding learning rate scales as Θ(width)Θ(\sqrt{width}) in the LV regime, not Θ(width)Θ(width) as μμP predicts.

We propose to use nonparametric Bernstein copulas as bivariate pair-copulas in high-dimensional vine models. The resulting smooth and nonparametric vine copulas completely obviate the error-prone need for choosing the pair-copulas from parametric copula families. By means of a simulation study and an empirical analysis…

2012-10-07abs ↗pdf ↗

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.

We present a novel approach for learning an HMM whose outputs are distributed according to a parametric family. This is done by {\em decoupling} the learning task into two steps: first estimating the output parameters, and then estimating the hidden states transition probabilities. The first step is accomplished by fit…

2013-02-25abs ↗pdf ↗

We propose that imitation between traders and their herding behaviour not only lead to speculative bubbles with accelerating over-valuations of financial markets possibly followed by crashes, but also to ``anti-bubbles'' with decelerating market devaluations following all-time highs. For this, we propose a simple marke…

1999-01-25abs ↗pdf ↗

Unified analysis for nonlinear parametric models in Bayesian optimization.

problem Limited theoretical guarantees for nonlinear parametric models in Bayesian optimization.
method Kernel-based framework for analyzing regularized nonlinear parametric models trained on adaptively collected data.
result Unified convergence guarantees for nonlinear acquisition and surrogate models.

A neural network learns efficient parametrizations of product shape spaces.

problem Efficiently parametrize complex shape spaces with high computational costs.
method Developed a neural network architecture that separately learns approximations for low-dimensional factors and combines them.
result Demonstrated the effectiveness of the approach on synthetic and real data.

New method estimates survival risks without strong proportional hazard assumptions.

problem Time-to-event prediction with censored data and competing risks.
method Jointly learns deep nonlinear representations for fully parametric survival regression.
result Demonstrates benefits in real-world datasets with different censoring levels.

Semiparametric Bayesian networks combine parametric and nonparametric models for flexible data analysis.

problem Combining the advantages of parametric and nonparametric models for flexible data analysis.
method Semiparametric Bayesian networks combining parametric and nonparametric conditional probability distributions. Modifications of two algorithms for structure learning from data.
result Accurately learns the combination of parametric and nonparametric components, comparable to state-of-the-art methods.

We use variational Gaussian approximations to analyze parametric models with unknown data-generating distributions.

problem Analyzing inference and learning in parametric models with unknown or intractable data-generating distributions.
method Replica method with variational Gaussian approximation in grand canonical formalism.
result Stationarity conditions adaptively determine parameters of the trial Hamiltonian for each dataset.