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.

169,051 papers · 148 categories

Trend · papers per month

3657291,0941,458 · Jun 202019922001200920172026
48 results for semiparametric reward model

New MAB algorithm for nonstationary, semiparametric reward models.

problem Nonstationary and non-linear reward models in sequential decision tasks.
method Contextual multi-armed bandit algorithm for semiparametric reward model.
result Proposed algorithm achieves a tight regret upper bound and performs well in simulations and real-world data.

This paper studies semiparametric contextual bandits, a generalization of the linear stochastic bandit problem where the reward for an action is modeled as a linear function of known action features confounded by an non-linear action-independent term. We design new algorithms that achieve O~(dT)\tilde{O}(d\sqrt{T}) regret …

2018-03-12abs ↗pdf ↗

New method optimizes policies without assuming known link functions between preferences and rewards.

problem Policy alignment with unknown and unrestricted link functions.
method Formulates an ff-divergence-constrained reward maximization problem, learning policies directly.
result Induces a semiparametric single-index binary choice model for policy alignment.

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.

This paper balances short-term and long-term rewards in policy learning.

problem Balancing short-term and long-term rewards in policy learning.
method Formalizes a new framework to balance rewards, identifies rewards under mild assumptions, deduces efficiency bounds, and develops a policy learning approach.
result The proposed method improves the estimator of long-term reward and reduces regret.

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.

The paper tackles batch policy learning in Markov Decision Processes, focusing on average reward maximization.

problem Maximizing long-term average reward in Markov Decision Processes with batch learning.
method Doubly robust estimator for average reward, optimization algorithm for optimal policy, finite-sample regret guarantee.
result The proposed method achieves semiparametric efficiency and provides a finite-sample regret guarantee.

Kernelized bandit algorithm tackles adaptive contextual bandits with single-index models.

problem Adaptive contextual bandits with single-index models and unknown link functions.
method Kernelized ε-greedy algorithm combining Stein-based index estimation and kernel ridge regression for reward functions.
result Unified framework for simultaneous learning and inference in single-index contextual bandits.

New method improves evaluation of new policies in reinforcement learning.

problem Efficient off-policy evaluation in Markov decision processes.
method Double Reinforcement Learning (DRL) estimator for qq-functions and marginalized density ratios.
result DRL is efficient and doubly robust under certain conditions.

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 ↗

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.

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 ↗

This paper improves reinforcement learning by estimating return distributions using quantiles.

problem Improving reinforcement learning by estimating return distributions.
method Quantile-based distributional reinforcement learning, using quantile-projected distributional Bellman equations.
result The quantile-based approach achieves optimal sample efficiency and asymptotic efficiency.

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.

This paper improves reinforcement learning by estimating return distributions using quantiles.

problem Improving reinforcement learning by estimating return distributions.
method The paper uses quantile-based distributional reinforcement learning to characterize return distributions.
result The quantile-based approach achieves optimal sample efficiency and asymptotic efficiency.

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.

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.

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 ↗

Proposes a framework for selecting machine learning algorithms in semiparametric models.

problem Model selection in semiparametric problems with high-dimensional nuisance parameters.
method Selective machine learning framework based on a novel pseudo-risk criterion.
result Empirical selection criterion performs nearly as well as an oracle in cross-validation.

A semiparametric test evaluates instrument validity and complier characteristics.

problem Evaluating the validity of instruments and complier characteristics.
method Semiparametric test, doubly robust moment, machine learning update.
result Validates instrument validity and complier characteristics.

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.

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.

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

Framework for multi-task learning with semiparametric models and nuisance parameters.

problem Improving parameter estimation from diverse, heterogeneous datasets.
method Late fusion multi-task learning framework with two-step process: individual task learning followed by adaptive aggregation.
result The method achieves faster convergence rates compared to individual task learning when tasks share similar parametric components.

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.

As the dynamic structure of the financial markets is subject to dramatic changes, a model capable of providing consistently accurate volatility estimates must not make strong assumptions on how prices change over time. Most volatility models impose a particular parametric functional form that relates an observed price …

2017-08-25abs ↗pdf ↗

Proposes a method for valid inference in GPLSIMs with longitudinal data.

problem Challenges in longitudinal data inference due to within-subject correlation and unstable variance estimation.
method Profile estimating-equation approach using spline approximation and block empirical likelihood.
result Block empirical likelihood ratio statistic with Wilks-type chi-square limit for joint inference.

New method embeds bipartite graphs into vectors, overcoming nonlinear challenges.

problem Learning vector representations for bipartite graphs with nonparametric components.
method Semiparametric exponential family distribution, pseudo-likelihood objective, gradient descent.
result Gradient descent achieves linear convergence rate and robust to model misspecification.

A novel approach combines interpretability and performance in machine learning models.

problem Lack of transparency in black box machine learning models.
method Semiparametric approach using ideas from sufficient dimension reduction and influence function based estimators.
result Optimized model combining interpretability and performance, demonstrated through simulations and a real-world ICU patient data application.

The paper introduces a DRM for causal inference, offering a flexible method to analyze counterfactual distributions.

problem Estimating mean causal effects is limited; a distributional perspective is needed for a more thorough understanding.
method The paper employs a semiparametric density ratio model (DRM) with an empirical likelihood (EL) approach to estimate counterfactual distribution functions.
result The DRM framework enables direct and transparent causal inference from a distributional perspective, validated by numerical studies.

DeepMed uses DNNs to estimate causal mediation effects without sparsity constraints.

problem Estimating Natural Direct and Indirect Effects in mediation analysis.
method DeepMed employs deep neural networks to cross-fit infinite-dimensional nuisance functions.
result DeepMed achieves semiparametric efficiency bound and adapts to low-dimensional nuisance structures.