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

3897781,1671,556 · Jun 202019922001200920172026
48 results for sparse semiparametric additive modeling

New estimators improve sparse semiparametric additive modeling.

problem Sparse semiparametric additive modeling with structured sparsity.
method Combines group subset selection with shrinkage for nonconvex optimization.
result New estimators outperform alternatives in synthetic and real-world data.

We develop a framework for learning sparse nonparametric directed acyclic graphs (DAGs) from data. Our approach is based on a recent algebraic characterization of DAGs that led to a fully continuous program for score-based learning of DAG models parametrized by a linear structural equation model (SEM). We extend this a…

2019-09-29abs ↗pdf ↗

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.

A new method learns the optimal pricing map for semiparametric dynamic pricing problems.

problem Optimizing pricing strategies in a semiparametric valuation model with unknown utility and noise.
method Developed a modular policy called ORBIT that uses a scalar pilot index, localizes a benchmark price, and learns a local polynomial approximation of the oracle price map.
result Achieves regret bound of \( \widetilde{O}\big(T^{\frac{2β-1}{4β-3}}+\sqrt{dT}\big) \) for the linear utility model and minimax sharp lower bound.

New algorithm identifies best arm in semiparametric bandits with near optimal efficiency.

problem Fixed-confidence Best Arm Identification in semiparametric bandits with unknown baseline shift.
method Phase-elimination algorithm based on orthogonalized regression design.
result Nearly optimal high-probability sample-complexity upper bound established.

Develops efficient inference for noise heterogeneity in machine learning models.

problem Downstream procedures based on residuals can be biased in additive noise models.
method Semiparametrically efficient inference using a novel Hilbert-valued one-step estimator.
result Constructs tests and confidence intervals for residual independence and goodness of fit.

New estimator optimizes black-box model errors in semiparametric estimation.

problem How nuisance estimation errors affect low-dimensional target parameters in semiparametric models.
method Proposed a new estimator achieving a sharper rate of convergence.
result The first-order stochastic error of nuisance estimation can be eliminated.

Flexible classifier using Mahalanobis distances for non-elliptical distributions.

problem Classifying non-elliptical and multimodal distributions.
method Semiparametric classifier based on Mahalanobis distances and generalized additive models.
result The proposed classifiers outperform traditional methods in high-dimensional, low-sample-size scenarios.

We present semiparametric spectral modeling of the complete larval Drosophila mushroom body connectome. Motivated by a thorough exploratory data analysis of the network via Gaussian mixture modeling (GMM) in the adjacency spectral embedding (ASE) representation space, we introduce the latent structure model (LSM) for n…

2017-05-09abs ↗pdf ↗

This paper presents a novel approach for incremental semiparametric inverse dynamics learning. In particular, we consider the mixture of two approaches: Parametric modeling based on rigid body dynamics equations and nonparametric modeling based on incremental kernel methods, with no prior information on the mechanical …

2016-01-18abs ↗pdf ↗

New method for semiparametric bandits reduces regret to optimal levels.

problem Complex reward structures in semiparametric bandits.
method Experimental-design approach with sharp regret bound and PAC bound.
result Minimax regret of ildeO(dT) ilde{O}(\sqrt{dT}) and logarithmic regret under positive suboptimality gap.

In this paper, we study statistical properties of semi-supervised learning, which is considered as an important problem in the community of machine learning. In the standard supervised learning, only the labeled data is observed. The classification and regression problems are formalized as the supervised learning. In s…

2012-04-18abs ↗pdf ↗

DNA-SE uses deep learning to solve semiparametric problems efficiently.

problem Solving semiparametric integral equations in high dimensions.
method Formulates semiparametric estimation as a bi-level optimization problem and uses DNN to approximate solutions.
result Demonstrates numerical and statistical advantages over traditional methods.

Knowledge distillation improves model accuracy by mimicking teacher model probabilities.

problem Improving model accuracy through model compression.
method Casting knowledge distillation as a semiparametric inference problem, deriving new guarantees, and developing enhancements.
result Enhancements improve student performance by mitigating teacher overfitting and underfitting.

New method uses fractional posteriors for semiparametric inference with improved uncertainty quantification.

problem Semiparametric inference with nonparametric priors and fractional posteriors.
method Established a general Bernstein--von Mises theorem for fractional posterior distributions, proposed shifted-and-rescaled credible sets.
result Fractional posterior credible sets provide reliable uncertainty quantification but have inflated size; shifted-and-rescaled set is an efficient confidence set.

Sparse additive modeling is a class of effective methods for performing high-dimensional nonparametric regression. In this work we show how shape constraints such as convexity/concavity and their extensions, can be integrated into additive models. The proposed sparse difference of convex additive models (SDCAM) can est…

2017-05-01abs ↗pdf ↗

To better understand the spatial structure of large panels of economic and financial time series and provide a guideline for constructing semiparametric models, this paper first considers estimating a large spatial covariance matrix of the generalized mm-dependent and ββ-mixing time series (with JJ variables and TT

2011-06-20abs ↗pdf ↗

A new distributed algorithm for fitting sparse additive models with feature division and decorrelation.

problem Fitting high-dimensional sparse additive models efficiently and accurately.
method Divide, decorrelate, and conquer approach.
result Effective and efficient recovery of sparsity patterns and statistical inference for each component.

HARFE approximates sparse additive functions using random features and ridge regression.

problem Approximating high-dimensional sparse additive functions.
method Hard-ridge random feature expansion with sparse ridge regression and hard-thresholding pursuit.
result HARFE method converges with a given error bound and achieves lower error than other algorithms.

Low-rank framework for task-specific LLM ranking from sparse comparisons.

problem Challenges in reliable task-specific ranking of LLMs under sparse, imbalanced comparisons.
method Low-rank modeling of task-by-model ability matrix, max-norm accurate estimator, task-wise top-K recovery guarantees, uncertainty quantification framework.
result Improves sample efficiency and produces tighter, better-calibrated ranking certificates.

Sparse generalized additive models (GAMs) are an extension of sparse generalized linear models which allow a model's prediction to vary non-linearly with an input variable. This enables the data analyst build more accurate models, especially when the linearity assumption is known to be a poor approximation of reality. …

2019-12-04abs ↗pdf ↗

New pruning method for sparse additive models speeds up causal structure learning.

problem Efficiently prune spurious edges from fully-connected DAG induced by estimated topological order.
method Sparse additive models combined with randomized tree embedding and group-wise sparse regression.
result Significantly faster than existing pruning methods while maintaining comparable accuracy.

RNNs solve modular addition tasks using low rank and sparse Fourier structures.

problem Solving modular addition tasks with recurrent neural networks.
method Identified low rank structures and sparse Fourier representations in RNN weights.
result RNNs robust to removing individual frequencies but degrade with more ablation.

We consider the problem of sparse variable selection in nonparametric additive models, with the prior knowledge of the structure among the covariates to encourage those variables within a group to be selected jointly. Previous works either study the group sparsity in the parametric setting (e.g., group lasso), or addre…

2012-06-18abs ↗pdf ↗

We introduce a new algorithm, called adaptive sparse backfitting algorithm, for solving high dimensional Sparse Additive Model (SpAM) utilizing symmetric, non-negative definite smoothers. Unlike the previous sparse backfitting algorithm, our method is essentially a block coordinate descent algorithm that guarantees to …

2014-09-08abs ↗pdf ↗

New method estimates Gaussian copulas with missing data using EM algorithm.

problem Estimating Gaussian copulas with missing data and prior assumptions.
method Rigorous application of the Expectation Maximization (EM) algorithm for marginal distributions and dependence structure.
result Joint distribution learned is closer to the underlying distribution.

Semiparametric STAR model improves mental health data analysis.

problem Overdispersed, zero-inflated, bounded count data in self-reported mental health surveys.
method STAR transformation and rounding of latent Gaussian model, nonparametric transformation estimation, EM algorithm for maximum likelihood.
result Substantial improvements in goodness-of-fit compared to existing models.

Proposes a new model for high-dimensional data analysis with unknown link function.

problem Estimating link function, component functions, and variable interactions in high-dimensional data.
method Generalized Sparse Additive Model with Unknown Link Function (GSAMUL) using B-spline basis and MLP network for link estimation, with 2,1\ell_{2,1}-norm regularizer for variable selection.
result Can realize both variable selection and hidden interaction.

PSQRNN model forecasts electricity consumption in China by integrating neural networks and quantile regression.

problem Electricity forecasting in China due to regional economic, social, and natural conditions.
method PSQRNN combines neural networks and semiparametric quantile regression to model electricity consumption.
result PSQRNN model outperforms traditional methods in forecasting electricity consumption in China.

We consider concepts and models for measuring inequality in the distribution of resources with a focus on how inequality varies as a function of covariates. Lorenz introduced a device for measuring inequality in the distribution of income that indicates how much the incomes below the uth^{th} quantile fall short of the…

2006-10-27abs ↗pdf ↗

We propose a new class of semiparametric exponential family graphical models for the analysis of high dimensional mixed data. Different from the existing mixed graphical models, we allow the nodewise conditional distributions to be semiparametric generalized linear models with unspecified base measure functions. Thus, …

2014-12-30abs ↗pdf ↗

Semiparametric method removes bias in functional bilevel gradient estimation.

problem First-order bias in plug-in hypergradient when lower-level problem is nonparametric.
method Semiparametric debiasing theory based on efficient influence function leads to cross-fitted orthogonal hypergradient estimator.
result Asymptotic normality and uniform control over outer parameter established for the estimator.

We study deep neural networks and their use in semiparametric inference. We establish novel rates of convergence for deep feedforward neural nets. Our new rates are sufficiently fast (in some cases minimax optimal) to allow us to establish valid second-step inference after first-step estimation with deep learning, a re…

2018-09-26abs ↗pdf ↗

Fast classification for sparse models, even with correlated features.

problem Sparse classification with many correlated features.
method Linear and quadratic surrogate cuts, priority queue, and analytical solution for exponential loss.
result 2 to 5 times faster than previous approaches, interpretable models with comparable accuracy.