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

198397595793 · Jun 202019922001200920172026
48 results for partial linear structure

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.

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.

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.

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.

Many interesting geometric structures can be described as regular infinitesimal flag structures, which occur as the underlying structures of parabolic geometries. Among these structures we have for instance conformal structures, contact structures, certain types of generic distributions and partially integrable almost …

2010-12-08abs ↗pdf ↗

In this paper we investigate fiber-wise linear complex Banach sub-Poisson structures defined canonically by the structure of a W*-algebra M. In particular we show that these structures are arranged in the short exact sequence of complex Banach sub-Poisson VB-groupoids with the groupoid of partially invertible elements …

2017-03-03abs ↗pdf ↗

We present a new Markov chain Monte Carlo method for estimating posterior probabilities of structural features in Bayesian networks. The method draws samples from the posterior distribution of partial orders on the nodes; for each sampled partial order, the conditional probabilities of interest are computed exactly. We…

2012-02-14abs ↗pdf ↗

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.

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.

On contact manifolds we describe a notion of (contact) finite-type for linear partial differential operators satisfying a natural condition on their leading terms. A large class of linear differential operators are of finite-type in this sense, and for any such operator we construct a partial connection on a (finite ra…

2009-10-28abs ↗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 ↗

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.

We introduce an effective method to solve the ˉ\bar\partial-harmonic forms on the Kodaira-Thurston manifold endowed with an almost complex structure and an Hermitian metric. Using the Weil-Brezin transform, we reduce the elliptic PDE system to countably many linear ODE systems. By solving a fundamental problem on line…

2020-01-29abs ↗pdf ↗

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.

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.

Motivated by Pan-Yang [PY] and Ma-Cheng [MC], we study a general linear nonlocal curvature flow for convex closed plane curves and discuss the short time existence and asymptotic convergence behavior of the flow. Due to the linear structure of the flow, this partial differential equation problem can be resolved using a…

2010-12-01abs ↗pdf ↗

Paper explores duality in DPPs using embedding structure analysis.

problem Understanding the geometric structure of determinantal point processes.
method Analyzes the exponential family embedding of DPPs and uses the e-embedding curvature tensor.
result Discovers the duality between marginal and L-ensemble kernels.

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.

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.

CoLA automates efficient numerical linear algebra for complex matrix structures.

problem Efficiently solving large-scale linear algebra problems with complex matrix structures.
method Combining linear operator abstraction with compositional dispatch rules.
result Automatic and efficient numerical algorithms for various linear algebra operations.

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.

Consistent partial identification of causal effects proved for neural models.

problem Consistency of neural causal partial identification methods.
method Proving consistency for neural models with continuous and categorical variables, considering architecture design and Lipschitz regularization.
result Proven consistency of partial identification via neural causal models in a general setting.

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.

In this lecture delivered at the Integrable and Quantum Field Theory at Peyresq sixth meeting, we review the Lychagin's Monge-Ampere operators theory and exhibit the link it establishes between the classical problem of local equivalence for non linear partial differential equations and the problem of integrability of s…

2006-12-18abs ↗pdf ↗

Bayesian approach learns linear networks from high-dimensional data.

problem Learning high-dimensional linear Bayesian networks.
method Iterative estimation of topological ordering and parents using inverse partial covariance matrix with Bayesian regularization.
result The method successfully recovers network structure under certain conditions.

We propose a formulation of the term structure of interest rates in which the forward curve is seen as the deformation of a string. We derive the general condition that the partial differential equations governing the motion of such string must obey in order to account for the condition of absence of arbitrage opportun…

1998-02-12abs ↗pdf ↗

New method uses models from regularity structures as features in machine learning.

problem Learning solutions to PDEs with low regularity.
method Developed a flexible definition of model feature vectors and two algorithms for combining them with linear regression.
result Advantage in learning solutions to PDEs compared to alternative methods.

A new graph neural network framework captures long-range interactions efficiently.

problem Efficiently modeling long-range interactions in graph neural networks for PDEs.
method Proposes a multi-level graph neural network framework using multipole methods.
result Captures interaction at all ranges with only linear complexity, learning discretization-invariant solution operators.

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.

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.

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 ↗

BAM model learns graph structure from data with robustness across linear and non-linear dependencies.

problem Detecting dependencies in datasets for graph structure learning.
method Proposes BAM, a neural network model using structural equation models and Chebyshev polynomials for training, with bilinear attention mechanism.
result Demonstrates robust generalizability and superior performance in graph estimation.

This paper extends semi-structured networks to functional data.

problem Maintaining interpretability in functional data analysis while capturing non-linearities and interactions.
method Proposes a functional SSN method that scales well and improves predictive performance.
result The functional SSN method accurately recovers underlying signals and performs favorably compared to competing methods.

New methods improve estimation accuracy in noisy settings.

problem Estimating treatment effects in the presence of treatment noise.
method Developed new structure-agnostic cumulant estimators and practical procedures for higher-order robustness.
result Demonstrated that existing DML estimator is suboptimal for non-Gaussian treatment noise and introduced ACE procedures for improved accuracy.

Paper offers robust recovery for 1-bit sensing with partial Gaussian circulant matrices.

problem Accurately recovering vectors from 1-bit measurements using structured matrices.
method Correlation-based optimization with randomly signed partial Gaussian circulant matrices and generative models.
result Recovery guarantees match those for i.i.d. Gaussian matrices but with faster computation.