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

3997971,1961,594 · Jun 202019922001200920172026
48 results for partial linear models

Proposes a partially linear structure to capture nonlinear relationships in mixture of experts models.

problem Suboptimal estimates due to linearity assumption in mixture of experts models.
method Introduces a partially linear structure that incorporates unspecified functions to capture nonlinear relationships.
result Establishes the identifiability of the proposed model under mild conditions and introduces a practical estimation algorithm.

IDS algorithm optimizes sequential decisions in various monitoring settings.

problem Optimizing sequential decisions in complex monitoring scenarios.
method Information-directed sampling (IDS) algorithm for linear partial monitoring.
result IDS achieves nearly worst-case rate optimality in finite-action games.

Flexible DNN for survival data, avoiding proportional hazards assumption.

problem Survival analysis with complex interactions and non-proportional hazards.
method Partially linear DNN model with a flexible nonparametric component.
result FLEXI-Haz achieves optimal convergence rates and asymptotic efficiency.

Study uses deep neural networks for inference in partially linear models with dependent data.

problem Inference in partially linear models with dependent data.
method First stage deep neural network (DNN) estimation followed by n\sqrt{n}-consistent and asymptotically normal estimator.
result The DNN-estimated finite dimensional parameter achieves n\sqrt{n}-consistency and asymptotic normality.

Linear recurrent networks explain reinforcement learning performance in partially observable settings.

problem Understanding why linear recurrent networks work in reinforcement learning with partial observability.
method Constructed and studied two linear filters for HMMs and action-controlled HMMs.
result Linear filters serve as sufficient statistics and reduce state ambiguity, explaining empirical reinforcement learning success.

Differentiable relaxation for inferring partial orders from noisy linear data.

problem Inference of partial orders from linear data with noisy observations.
method Introducing a differentiable relaxation to model noisy linear extensions, replacing discontinuous precedence and feasibility with smooth surrogates.
result Smooth posterior that preserves partial-order semantics, supports gradient-based inference, and converges to hard likelihood.

This paper provides estimation and inference methods for an identified set's boundary (i.e., support function) where the selection among a very large number of covariates is based on modern regularized tools. I characterize the boundary using a semiparametric moment equation. Combining Neyman-orthogonality and sample s…

2017-12-28abs ↗pdf ↗

AdaptOn achieves logarithmic regret in adaptive control of unknown partially observable linear systems.

problem Adaptive control in partially observable linear dynamical systems.
method AdaptOn algorithm that estimates system dynamics through online learning and gradient descent.
result AdaptOn achieves a logarithmic regret bound of polylog(T) after T steps.

We study the problem of regret minimization in partially observable linear quadratic control systems when the model dynamics are unknown a priori. We propose ExpCommit, an explore-then-commit algorithm that learns the model Markov parameters and then follows the principle of optimism in the face of uncertainty to desig…

2020-01-31abs ↗pdf ↗

New method controls linear systems with partial info and disturbances.

problem Controlling linear dynamical systems under partial observation and adversarial disturbances.
method Double Spectral Control (DSC) using two-level spectral approximation strategy.
result Matches best known regret guarantees with exponential runtime improvement.

New method disentangles perceptual uncertainty and behavioral costs in partially observable systems.

problem Tackles inverse optimal control for non-linear partially observable systems.
method Probabilistic approach using maximum causal entropy formulations and local linearization.
result Disentangles perceptual factors and behavioral costs in sequential decision-making.

KalmanNet uses neural networks to improve state estimation in systems with unknown dynamics.

problem State estimation of systems with non-linear dynamics and partial information.
method KalmanNet integrates a recurrent neural network with the Kalman filter to handle non-linearities and model mismatches.
result KalmanNet outperforms classic filtering methods in systems with both mismatched and accurate domain knowledge.

The generalized partially linear additive model (GPLAM) is a flexible and interpretable approach to building predictive models. It combines features in an additive manner, allowing each to have either a linear or nonlinear effect on the response. However, the choice of which features to treat as linear or nonlinear is …

2014-07-17abs ↗pdf ↗

A new method combines machine learning with mixed-effects models for better repeated measurement analysis.

problem Inference of linear coefficients in partially linear mixed-effects models with complex interactions and high-dimensional variables.
method Double machine learning approach to estimate nonparametrically nonlinear variables, then use standard linear mixed-effects techniques to estimate the linear coefficient.
result The estimated fixed effects coefficient converges at the parametric rate and is semiparametrically efficient.

PCBM improves neural network generalization by partially observing concepts.

problem Decreased generalization performance due to observing all concepts in CBM.
method Developed a theoretical analysis of PCBM's Bayesian generalization error.
result PCBM's generalization error is lower than CBM's due to partial concept observation.

Partial monitoring is a rich framework for sequential decision making under uncertainty that generalizes many well known bandit models, including linear, combinatorial and dueling bandits. We introduce information directed sampling (IDS) for stochastic partial monitoring with a linear reward and observation structure. …

2020-02-25abs ↗pdf ↗

We propose a partially linear additive Gaussian graphical model (PLA-GGM) for the estimation of associations between random variables distorted by observed confounders. Model parameters are estimated using an L1L_1-regularized maximal pseudo-profile likelihood estimator (MaPPLE) for which we prove n\sqrt{n}-sparsisten…

2019-06-08abs ↗pdf ↗

New algorithms solve robust MDPs efficiently, significantly faster than existing methods.

problem Computing robust MDP solutions with uncertainty in transition probabilities is computationally expensive.
method Partial policy iteration and fast robust Bellman operator computation methods.
result The proposed methods are many orders of magnitude faster than state-of-the-art approaches.

The paper addresses nonconvex penalized LAD estimation in partial linear models using DNNs.

problem Challenges in nonconvex penalized LAD estimation with DNNs in partial linear models.
method Parameterizes nonparametric term with DNNs, formulates penalized LAD problem, introduces proximal subgradient method.
result Establishes consistency, convergence rate, and asymptotic normality of the estimator.

Paper addresses linear regression with partially mismatched data using local search with theoretical guarantees.

problem Linear regression with partially mismatched data.
method Optimization formulation and greedy local search algorithm with theoretical guarantees.
result Local search algorithm converges to nearly-optimal solution at a linear rate under certain conditions.

Paper develops a method for estimating PFLM with minimized rates in high dimensions.

problem Estimating PFLM with minimized rates in high dimensions.
method Least square approach with mixed regularizations of function-norm and ℓ1-norm.
result Established optimal minimax rates of estimation for PFLM.

New Thompson sampling algorithm for stochastic partial monitoring achieves logarithmic regret.

problem Limited feedback in sequential learning problems.
method Developed a novel Thompson-sampling-based algorithm to sample from the posterior distribution exactly.
result Achieved logarithmic regret bound of O(log T) for a linearized variant of the problem.

Study efficient reinforcement learning for partially observed systems with linear structure.

problem Efficient reinforcement learning for partially observed Markov decision processes with linear structure.
method Proposes OP-TENET algorithm using a Bellman operator with finite memory, adversarial integral equation, and optimistic exploration.
result Achieves ε-optimal policy within O(1/ε^2) episodes with polynomial sample complexity in intrinsic dimension.

Proposes a new model to analyze CT scans for lung cancer patients.

problem Analyzing survival risks of lung cancer patients using CT scans.
method Penalized Deep Partially Linear Cox Model (Penalized DPLC) incorporating SCAD penalty and deep neural network.
result The model effectively selects important texture features and estimates nonparametric components.

The paper tackles causal disentanglement with linear models and interventions.

problem Identify latent variables in a causal model from observed data.
method Use linear transformations and interventions to uniquely identify latent variables.
result A single intervention on each latent variable is sufficient for identifying the latent causal model.

In the context of sparse recovery, it is known that most of existing regularizers such as 1\ell_1 suffer from some bias incurred by some leading entries (in magnitude) of the associated vector. To neutralize this bias, we propose a class of models with partial regularizers for recovering a sparse solution of a linear …

2015-11-23abs ↗pdf ↗

Variable selection plays an important role in the high-dimensional data analysis. However the high-dimensional data often induces the strongly correlated variables problem. In this paper, we propose Elastic Net procedure for partially linear models and prove the group effect of its estimate. By a simulation study, we s…

2015-07-22abs ↗pdf ↗

AR model forecasts partially observed dynamical time series by estimating evolution function and imputing missing variables.

problem Forecasting dynamical time series with missing variables.
method Autoregressive with slack time series (ARS) model.
result ARS model forecasts future time series with time-invariant and linear assumptions.

We tackle linear bandits with partially observable features, achieving sublinear regret.

problem Linear regret due to unobserved features in partially observable linear bandits.
method Feature augmentation with orthogonal basis vectors and a doubly robust estimator.
result Sublinear regret bound of ildeO((d+dh)T) ilde{O}(\sqrt{(d + d_h)T}).

Paper develops efficient Bayesian inference for enzymatic SRNs with LNA metamodel.

problem Bayesian inference for nonlinear SDE-based mechanistic models with partial observations and measurement errors.
method Interpretable Bayesian updating LNA metamodel and efficient posterior sampling.
result Proposed approach demonstrates promising performance in empirical studies.

Study optimizes prediction error for growing-dimensional PFLM models.

problem Optimizing prediction error for growing-dimensional PFLM models.
method Penalized least-squares approach in RKHS with effective dimension consideration.
result Shows exact upper bound for excess prediction risk in non-asymptotic form.

DPLS improves asset pricing by capturing non-linear risk factor structures.

problem Estimating asset pricing models with non-linear risk factor structures.
method Deep Partial Least Squares (DPLS) for dynamic and flexible factor modeling.
result DPLS models outperform linear models in asset pricing, capturing non-linear risk factor interactions.

Absolutely partially hyperbolic surface endomorphisms have a coherent center foliation.

problem Understanding the dynamics of absolutely partially hyperbolic surface endomorphisms.
method Showed the existence of a center foliation and leaf conjugacy to the linearization.
result Absolutely partially hyperbolic surface endomorphisms have a dynamically coherent center foliation.

TOFU-POV tackles partially observed linear bandits, achieving sublinear regret with low-dimensional action vectors.

problem Stochastic linear bandits with partially observed actions in settings like recommendation and healthcare.
method TOFU-POV estimates latent action subspace, imputes missing actions, and runs OFUL in low-dimensional coordinates.
result TOFU-POV achieves T\sqrt{T} regret scaling with intrinsic subspace dimension, improving upon natural baselines.

New method identifies causal variables from partially observed data.

problem Learning from unpaired observations with instance-dependent partial observability.
method Proposes two methods enforcing sparsity in the inferred representation.
result Establishes two identifiability results for linear and piecewise linear mixing functions.

E-LMC improves spatial field prediction accuracy by linearizing complex fields.

problem Predicting complex spatial fields with high accuracy and efficiency.
method Introducing an invertible neural network to linearize nonlinear spatial fields, enabling the use of LMC for nonlinear problems.
result Maximum improvement of about 40% over original LMC, outperforming other models.