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

153306459612 · Jun 202019922001200920172026
48 results for linear dependence

Improved gap-dependent bounds for reinforcement learning with linear approximations.

problem Achieving nearly minimax-optimal performance with linear function approximation.
method Developed and analyzed the LSVI-UCB++ algorithm and its concurrent variant.
result First gap-dependent regret bound for nearly minimax-optimal algorithm LSVI-UCB++.

Machine learning improves joint default assessment by capturing non-linear dependencies.

problem Capturing non-linear dependencies among covariates for accurate joint default assessment.
method Application of machine learning techniques to credit card dataset, comparing with logistic regression.
result Machine learning outperforms logistic regression in assessing portfolio riskiness.

Unified framework for corruption-robust linear bandits with optimal gap-dependent misspecification bounds.

problem Effective learning in linear bandits with corrupted rewards across different corruption models.
method Unified framework for analyzing strong and weak corruption, connection to gap-dependent misspecification, and specialized algorithm.
result Optimal bounds for gap-dependent misspecification in linear bandits.

Develops inequalities for high-dimensional linear processes with dependent innovations.

problem Estimating high-dimensional VAR(p) systems and HAC covariance estimation.
method Concentration inequalities for ll_\infty norm of vector linear processes with sub-Weibull, mixingale innovations.
result Obtained concentration bounds for the maximum entrywise norm of lag-hh autocovariance matrices.

Analyzes multi-day stock returns, showing linear volatility and mean dependence.

problem Linear dependence of volatility and mean in accumulated stock returns.
method Modified Jones-Faddy skew t-distribution analysis.
result Linear dependence of volatility and mean on the number of days of accumulation.

Study bounds noise level in linear regression with dependent data.

problem Analyzing noise level in linear regression with dependent data.
method Derive upper bounds for random design linear regression with ββ-mixing data, without realizability assumptions.
result Correctly recovers the noise level of the problem, exhibiting graceful degradation with misspecification.

Study on linear regression with dependent covariates, proving universality and error characterization.

problem Linear regression with dependent covariates in high-dimensional settings.
method Analysis of ridge regression performance, Gaussian universality theorem, spectral properties of covariance matrices.
result Asymptotic performance of ridge regression is invariant under non-Gaussian covariates with preserved mean and covariance.

Paper introduces data-dependent SSP for private linear and logistic regression.

problem Private linear and logistic regression with better performance.
method Data-dependent sufficient statistic perturbation (SSP) for linear and logistic regression.
result Data-dependent SSP outperforms state-of-the-art methods for linear and logistic regression.

CDSSL improves representation quality by integrating linear and nonlinear dependencies.

problem Scarcity of labeled data and neglect of nonlinear dependencies in SSL.
method CDSSL combines linear correlations and nonlinear dependencies using HSIC in RKHS.
result CDSSL enhances representation quality on diverse benchmarks.

The standard linear and logistic regression models assume that the response variables are independent, but share the same linear relationship to their corresponding vectors of covariates. The assumption that the response variables are independent is, however, too strong. In many applications, these responses are collec…

2019-05-08abs ↗pdf ↗

Study forecasts stock returns on JSE using SGDLMs capturing cross-series dependencies.

problem Accurate forecasting of multivariate time series data.
method Simultaneous Graphical Dynamic Linear Models (SGDLMs) with customised DLMs and importance sampling/mean-field variational Bayes.
result SGDLMs accurately forecast stock data on JSE and respond to market changes.

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.

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.

We introduce the Randomized Dependence Coefficient (RDC), a measure of non-linear dependence between random variables of arbitrary dimension based on the Hirschfeld-Gebelein-Rényi Maximum Correlation Coefficient. RDC is defined in terms of correlation of random non-linear copula projections; it is invariant with respec…

2013-04-29abs ↗pdf ↗

The paper considers the block sampling method for long-range dependent processes. Our theory generalizes earlier ones by Hall, Jing and Lahiri (1998) on functionals of Gaussian processes and Nordman and Lahiri (2005) on linear processes. In particular, we allow nonlinear transforms of linear processes. Under suitable c…

2013-12-20abs ↗pdf ↗

New Shapley values reveal non-linear feature dependencies.

problem Understanding non-linear dependencies in machine learning models.
method Model-independent Shapley values using non-parametric measures of dependence.
result Model-independent Shapley values can uncover non-linear dependencies.

BELIEF framework interprets GLMs using binary linear models.

problem Understanding and interpreting generalized linear models (GLMs) with binary outcomes.
method Developed a framework called binary expansion linear effect (BELIEF) to interpret GLMs through transparent linear models.
result BELIEF framework reveals perfect predictors in complete separation scenarios.

Study optimal and instance-dependent guarantees for solving linear equations with Markovian data.

problem Approximately solving linear fixed point equations with Markovian data.
method Non-asymptotic bounds and instance-dependent characterizations for stochastic approximation.
result Instance-optimality of the averaged SA estimator and matching upper and lower bounds.

Papers learn from data to make decisions without interacting, improving on previous methods.

problem Achieving optimal decision-making from offline data with non-linear function approximation.
method Pessimistic Nonlinear Least-Square Value Iteration (PNLSVI) with three innovative components.
result Achieves minimax optimal instance-dependent regret for non-linear function approximation.

The paper tackles long-context linear system identification with improved sample complexity bounds.

problem Identifying dynamical systems with long dependencies over fixed context windows.
method Established sample complexity bounds for systems with linear dependencies over a context window of length p.
result The learning process is not hindered by slow mixing properties in extended context windows.

In this pre-print we explore the multi-fractal properties of 1 minute traded volume of the equities which compose the Dow Jones 30. We also evaluate the weights of linear and non-linear dependences in the multi-fractal structure of the observable. Our results show that the multi-fractal nature of traded volume comes es…

2005-12-24abs ↗pdf ↗

Unified approach for non-stationary linear bandits with dynamic regret.

problem Non-stationary linear bandits with round-specific feasible actions and drifting reward models.
method Unified misspecification-reduction viewpoint, restarting algorithms with misspecification-dependent regret guarantees.
result Optimal \(T^{2/3}P_T^{1/3}\) dynamic-regret dependence for both linear bandits and contextual linear bandits.

Non-linear shrinkage isn't optimal for portfolio optimization, especially when asset dependence is non-stationary.

problem Optimizing portfolios with non-stationary asset dependence structures.
method Derived and compared non-linear shrinkage with an optimal target for covariance matrix estimation.
result Non-linear shrinkage can be significantly improved for portfolio optimization.

Improved confidence bounds for linear logistic model with applications to bandits.

problem Improving confidence bounds for linear logistic model.
method Self-concordant analysis of the logistic loss to avoid dependence on worst-case variance.
result Significant improvement in confidence bounds, avoiding dependence on 1/κ1/κ.

Two algorithms tackle heavy-tailed rewards in reinforcement learning with linear function approximation.

problem Online sequential decision-making with heavy-tailed rewards.
method AdaOFUL and VARA algorithms for linear stochastic bandits and MDPs, using modified adaptive Huber regression.
result Achieved state-of-the-art and variance-aware regret bounds for heavy-tailed rewards.

New analysis shows GMD can converge linearly under PL-like conditions.

problem Establishing linear convergence for generalized mirror descent.
method PL-based analysis for time-dependent mirrors, Taylor-series approach for stochastic GMD.
result Linear convergence of stochastic GMD under PL-like conditions.

Clarifies method of phase synchronization for decoupling linear differential equations.

problem Velocity-dependent transformations in linear second-order differential equations.
method Linear transformation of coordinates and velocities.
result Velocity-dependent transformations do not preserve second-order character and define their own system.

Graph convolutional networks adapt the architecture of convolutional neural networks to learn rich representations of data supported on arbitrary graphs by replacing the convolution operations of convolutional neural networks with graph-dependent linear operations. However, these graph-dependent linear operations are d…

2017-11-03abs ↗pdf ↗

Develops privacy-preserving methods for longitudinal linear regression.

problem Protecting individual information in longitudinal data with privacy-preserving statistics.
method Proposes a user-level private regression estimator and a privatized covariance estimator for longitudinal linear regression under user-level differential privacy.
result Establishes theoretical guarantees for practical user-level differential privacy estimation and inference in longitudinal linear regression.

New algorithm reduces sample complexity for sparse linear regression.

problem Sparse linear regression with correlated covariates and approximate dependencies.
method Polynomial-time algorithm that adapts the Lasso to tolerate approximate dependencies.
result Achieves near-optimal sample complexity for constant sparsity and ill-conditioned covariates.

Optimal algorithms identify non-dominated arms in multi-output linear bandit models.

problem Identifying the Pareto Set in multi-output linear bandit models.
method Design-based algorithms for Pareto Set Identification (PSI) in a structured multi-output linear bandit model.
result Nearly optimal guarantees in both fixed-budget and fixed-confidence settings.

This work presents an exact solution to the generalized Heston model, where the model parameters are assumed to have linear time dependence The solution for the model in expressed in terms of confluent hypergeometric functions.

2014-02-23abs ↗pdf ↗

A canonically defined mod 2 linear dependency current is associated to each collection of m sections of a real rank n vector bundle. This current is supported on the linear dependency set of the collection of sections. It is defined whenever the collection satisfies a weak measure theoretic condition called "atomicity"…

1996-09-17abs ↗pdf ↗

The paper tackles exact linearization and control of flat discrete-time systems.

problem Exact linearization and control of flat nonlinear discrete-time systems.
method Investigates conditions for choosing new inputs and feedbacks that may depend on forward-shifts of the new input.
result Easily verifiable conditions for choosing a feasible input and a new input that minimizes forward-shifts of the flat output.

The paper shows how data and algorithm interactions affect overparameterized linear regression generalization.

problem Understanding generalization in overparameterized linear regression.
method Introducing data-algorithm compatibility and performing data-dependent trajectory analysis with gradient descent.
result Early stopping iterates lead to better generalization than last-iterate analysis, with weaker restrictions.