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

6501,3001,9502,600 · Jun 202019922001200920172026
48 results for linear model of coregionalization

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.

Develops a scalable multi-task Gaussian process with neural embedding for improved performance.

problem High model complexity and limited model capability in multi-task Gaussian processes.
method Neural embedding of coregionalization, advanced variational inference, sparse approximation.
result Higher prediction quality and better generalization of the NSVLMC model.

MO-GP models fill gaps in biophysical data with across-domain info transfer.

problem Gap filling of biophysical parameters LAI and fAPAR over rice areas.
method Multi-output Gaussian Processes (MO-GP) based on Linear Model of Coregionalization (LMC).
result MO-GP models successfully predict biophysical variables even in high missing data regimes.

DeepICMGP surrogate models multiple outputs efficiently.

problem Challenges in modeling dependencies between multiple outputs using traditional multi-output GPs.
method Introduces hierarchical coregionalization structures across layers in DGPs.
result Demonstrates competitive performance and active learning strategies.

Multitask Gaussian process (MTGP) is powerful for joint learning of multiple tasks with complicated correlation patterns. However, due to the assembling of additive independent latent functions, all current MTGPs including the salient linear model of coregionalization (LMC) and convolution frameworks cannot effectively…

2018-08-03abs ↗pdf ↗

Paper introduces a new model to handle multi-task learning across different input domains.

problem Learning correlated tasks across varying input domains.
method Develops a novel heterogeneous stochastic variational linear model of coregionalization (HSVLMC) for multi-task learning.
result The proposed model outperforms existing models in diverse multi-task scenarios.

We generalize the log Gaussian Cox process (LGCP) framework to model multiple correlated point data jointly. The observations are treated as realizations of multiple LGCPs, whose log intensities are given by linear combinations of latent functions drawn from Gaussian process priors. The combination coefficients are als…

2018-05-24abs ↗pdf ↗

Gaussian processes (GPs), or distributions over arbitrary functions in a continuous domain, can be generalized to the multi-output case: a linear model of coregionalization (LMC) is one approach. LMCs estimate and exploit correlations across the multiple outputs. While model estimation can be performed efficiently for …

2017-05-30abs ↗pdf ↗

IPGP framework improves psychological assessment by integrating shared and unique traits.

problem Tackles the debate on shared vs unique personality traits across individuals.
method Uses Gaussian process coregionalization model for non-Gaussian ordinal data, with stochastic variational inference for scalability.
result Improves prediction and estimation of individualized factor structures compared to existing methods.

The paper tackles counterfactual inference with multioutput deep kernels in high-dimensional settings.

problem Performing counterfactual inference with observational data in high-dimensional settings with multiple actions and outcomes.
method The paper presents a general class of counterfactual multi-task deep kernels models based on Structural Causal Models (SCM) and Gaussian Processes.
result The models estimate causal effects and learn policies efficiently, scaling well with high dimensions.

In many settings, as for example wind farms, multiple machines are instantiated to perform the same task, which is called a fleet. The recent advances with respect to the Internet of Things allow control devices and/or machines to connect through cloud-based architectures in order to share information about their statu…

2019-11-22abs ↗pdf ↗

Efficiently predicts high-fidelity PDE solutions using multi-fidelity Gaussian processes.

problem Expensive high-fidelity solutions for PDEs on discretized domains.
method Multi-Fidelity High-Order Gaussian Process (MFHoGP) that integrates multi-fidelity examples and scales to large numbers of outputs.
result Significantly reduces the cost of high-fidelity PDE solutions through efficient Gaussian process modeling.

Extends GP regression to complex Helmholtz problems, improving wavefield inference in brain elastography.

problem Infer complex Helmholtz wavefields from sparse, noisy data.
method Operator-informed Gaussian processes, realifying complex operator into real blocks, using PDE residuals and boundary traces.
result Competitive with finite-difference and neural-network methods, reconstructs brain shear curl field with high correlation.

Analyzes neural networks using linear models to understand their behavior.

problem Understanding multi-layer neural networks through linear models.
method Recalls and reviews four models: linear regression with concentrated features, kernel ridge regression, random feature model, and neural tangent model.
result Highlights limitations of linear theory and discusses approaches to overcome them.

Unified derivation of high-dimensional linear models using stochastic gradient descent.

problem Performance analysis of high-dimensional linear models trained with stochastic gradient descent.
method Derivation of a deterministic equivalence for the two-point function of a random matrix resolvent.
result Unified understanding of model performance including previously known and novel results.

Region-specific linear models are widely used in practical applications because of their non-linear but highly interpretable model representations. One of the key challenges in their use is non-convexity in simultaneous optimization of regions and region-specific models. This paper proposes novel convex region-specific…

2014-10-31abs ↗pdf ↗

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.

Gaussian processes retain the linear model either as a special case, or in the limit. We show how this relationship can be exploited when the data are at least partially linear. However from the perspective of the Bayesian posterior, the Gaussian processes which encode the linear model either have probability of nearly…

2008-04-29abs ↗pdf ↗

Paper presents a machine learning method to improve significance tests for misspecified linear models.

problem Misspecification of linear assumptions in social science models leads to inaccurate significance levels.
method Apply machine learning to fit ground truth function, calculate linear approximation, and adjust the estimator.
result The method significantly outperforms linear regression for non-linear ground truth functions.

Jump Markov linear models consists of a finite number of linear state space models and a discrete variable encoding the jumps (or switches) between the different linear models. Identifying jump Markov linear models makes for a challenging problem lacking an analytical solution. We derive a new expectation maximization …

2014-09-25abs ↗pdf ↗

Analyzes generalization error in generalized linear models, explaining double descent phenomenon.

problem Understanding generalization of machine learning models in high dimensions.
method Develops a framework to characterize asymptotic generalization error for generalized linear models.
result Rigorously explains the double descent phenomenon in generalized linear models.

New approach improves linear-time attention for language models.

problem Challenges of quadratic attention in long-sequence modelling, especially for discrete data.
method Reinterpreting linear attention through latent probabilistic graphical models, introducing asymmetric structure and recurrent parameterisation.
result Our model achieves competitive performance and outperforms existing linear attention variants on language modelling benchmarks.

Linear properties are either universal or absent across language models.

problem Explaining the prevalence of linear properties in language models.
method Proved identifiability of distribution-equivalent next-token predictors and analyzed various notions of linearity.
result Linear properties either hold in all or none distribution-equivalent next-token predictors.

LoLCATs improves linearized LLM quality with less memory and compute.

problem Linearizing large language models (LLMs) often degrades model quality and requires expensive training.
method Two-step method: attention transfer and low-rank adaptation.
result Significant improvement in linearizing quality with 20+ points on 5-shot MMLU.

Review of privacy-preserving linear models for high-dimensional data.

problem Overfitting and data memorization in high-dimensional linear models.
method Comprehensive comparison of optimization techniques for differentially private high-dimensional linear models.
result Coordinate-optimized algorithms perform best in empirical tests.

This work explains how linear representations in large language models arise from training objectives and gradient descent.

problem Understanding the origins of linear representations in large language models.
method A latent variable model to abstract and formalize concept dynamics, combined with analysis of the softmax cross-entropy objective and gradient descent.
result Linear representations emerge when learning from data matching the latent variable model, and this simple structure suffices to yield linear representations.

In machine learning and data mining, linear models have been widely used to model the response as parametric linear functions of the predictors. To relax such stringent assumptions made by parametric linear models, additive models consider the response to be a summation of unknown transformations applied on the predict…

2017-10-16abs ↗pdf ↗

We learn linear models from nonlinear systems using multiple trajectories and regularization.

problem Identifying linear models from data when the underlying dynamics are nonlinear.
method Multiple trajectories data acquisition followed by regularized least squares.
result Learn linearized dynamics with arbitrarily small error given enough samples.

Develops fast approximations for conditional Shapley values in linear and polynomial models.

problem Estimating conditional Shapley values using regression models is computationally expensive.
method A new approximative estimation method for conditional Shapley values using linear and polynomial regression models.
result Our method significantly reduces computation time compared to existing methods.

In this paper we investigate general linear stochastic volatility models with correlated Brownian noises. In such models the asset price satisfies a linear SDE with coefficient of linearity being the volatility process. This class contains among others Black-Scholes model, a log-normal stochastic volatility model and H…

2009-09-25abs ↗pdf ↗

Log-linear models are the popular workhorses of analyzing contingency tables. A log-linear parameterization of an interaction model can be more expressive than a direct parameterization based on probabilities, leading to a powerful way of defining restrictions derived from marginal, conditional and context-specific ind…

2014-09-09abs ↗pdf ↗

The paper analyzes the generalizability of linear autoencoders and multivariate linear regression.

problem Limited theoretical understanding of linear autoencoders' performance.
method Proposes a PAC-Bayes bound for multivariate linear regression and shows LAEs as constrained models.
result The proposed PAC-Bayes bound is tight and correlates with practical metrics.

Dynamic linear models improve travel time prediction for congested freeways.

problem Accurate travel time prediction for congested freeways.
method Dynamic linear models (DLMs) with time-varying parameters.
result Significant improvements in travel time prediction accuracy, especially for short-term predictions.