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

199399598797 · Jun 202019922001200920172026
48 results for GLM optimization

The generalized linear model (GLM) plays a key role in regression analyses. In high-dimensional data, the sparse GLM has been used but it is not robust against outliers. Recently, the robust methods have been proposed for the specific example of the sparse GLM. Among them, we focus on the robust and sparse linear regre…

2018-02-09abs ↗pdf ↗

Generalized principal component analysis (GLM-PCA) facilitates dimension reduction of non-normally distributed data. We provide a detailed derivation of GLM-PCA with a focus on optimization. We also demonstrate how to incorporate covariates, and suggest post-processing transformations to improve interpretability of lat…

2019-07-03abs ↗pdf ↗

Paper analyzes sparse aggregation in GLMs with Kullback-Leibler risk bounds.

problem Sparse aggregation in GLMs for parameter approximation.
method Exponential weighted aggregation scheme with Kullback-Leibler risk bounds.
result Sharp oracle inequality for Kullback-Leibler risk with leading constant 1 and minimax-optimal rate of aggregation.

We study two randomized algorithms for generalized linear bandits. The first, GLM-TSL, samples a generalized linear model (GLM) from the Laplace approximation to the posterior distribution. The second, GLM-FPL, fits a GLM to a randomly perturbed history of past rewards. We analyze both algorithms and derive $\tilde{O}(…

2019-06-21abs ↗pdf ↗

A novel multi-objective optimization framework improves insurance pricing fairness.

problem Exacerbated trade-offs between competing fairness criteria in insurance pricing using machine learning.
method Proposes a novel multi-objective optimization framework using NSGA-II to jointly optimize accuracy and fairness criteria.
result Consistently achieves a balanced compromise between accuracy and fairness, outperforming single-model approaches.

DP-GD achieves dimension-independent convergence for unconstrained private GLMs.

problem Differentially private empirical risk minimization for unconstrained GLMs.
method Differentially private gradient descent (DP-GD).
result DP-GD achieves an excess empirical risk of $ ilde O\left(\sqrt{ exttt{rank}}/εn ight)$ for unconstrained GLMs.

Paper proposes an alternative to MLE for GLMs with non-canonical link functions.

problem Challenges in MLE for GLMs with non-canonical link functions.
method Variational Inequality (VI) estimation framework.
result Established finite-sample error bounds and asymptotic normality for VI estimator.

New methods for quantifying insurance claim cost uncertainty using LightGBM and GLMs.

problem Quantifying prediction uncertainty in insurance claim costs.
method Proposed non-conformity measures for GLMs and GBMs with Tweedie loss.
result Locally weighted Pearson residuals outperform other methods in maintaining nominal coverage with smallest average width.

Paper analyzes GLM-tron for high-dimensional ReLU regression, providing upper and lower bounds.

problem Learning a single ReLU neuron in high-dimensional settings with overparameterization.
method Perceptron-type algorithm GLM-tron, with finite-sample analysis.
result Sharp characterization of high-dimensional ReLU regression problems via GLM-tron, contrasting with SGD.

Optimal downsampling improves GLM performance in imbalanced classification.

problem Improving GLM performance in imbalanced classification.
method Proposed a pseudo maximum likelihood estimator for optimal downsampling.
result The introduced estimator outperforms existing alternatives in both synthetic and empirical data.

We propose Dirichlet Process mixtures of Generalized Linear Models (DP-GLM), a new method of nonparametric regression that accommodates continuous and categorical inputs, and responses that can be modeled by a generalized linear model. We prove conditions for the asymptotic unbiasedness of the DP-GLM regression mean fu…

2009-09-28abs ↗pdf ↗

Accurate statistical models of neural spike responses can characterize the information carried by neural populations. But the limited samples of spike counts during recording usually result in model overfitting. Besides, current models assume spike counts to be Poisson-distributed, which ignores the fact that many neur…

2016-05-10abs ↗pdf ↗

A framework connects VAEs to GLMs for better model initialization and performance.

problem Understanding and optimizing loss function critical points in VAEs.
method Introducing a theoretical framework based on GLM and EDFs.
result Maximum likelihood initialization improves VAE performance.

Develops a new GLM framework for claims reserving with adaptive estimation.

problem Accurate assessment of claims reserves with dynamic and dependent claim activity.
method Multivariate evolutionary GLM framework with adaptive particle filtering algorithm.
result Adaptive estimation of evolving factors improves claims reserve accuracy.

Analyzes SGD dynamics in high-dimensional settings for GLMs and multi-index models.

problem Understanding SGD learning in high-dimensional settings for generalized linear models and multi-index models.
method Deterministic equivalent of SGD as ODEs and simplified SDE for analysis.
result Obtained learning rate thresholds and convergence guarantees for SGD.

Improved robust regression algorithms with faster runtime and better estimation rates.

problem Statistical regression problems under strong contamination model.
method Nearly-linear time algorithms using robust gradient descent and Sever framework.
result Improved estimation rates and runtime compared to state-of-the-art.

PANDA augments data to regularize GLM estimation and inference.

problem Regularizing estimation and inference in GLMs with noisy data.
method Iteratively optimizes augmented noise data to converge to regularized model estimates.
result Established convergence and asymptotic distributions for regularized parameters.

Neuroscientific theory suggests that dopaminergic neurons broadcast global reward prediction errors to large areas of the brain influencing the synaptic plasticity of the neurons in those regions. We build on this theory to propose a multi-agent learning framework with spiking neurons in the generalized linear model (G…

2019-10-15abs ↗pdf ↗

The balance property is crucial for insurance pricing, ensuring total actuarial price equals loss. Maximum likelihood GLMs fulfill it, but Lindholm-Wüthrich suggests three methods, with constrained GLM being superior.

problem Ensuring the balance property in insurance pricing models
method Using constrained GLM fitting
result Constrained GLM fitting is superior to the two previously discussed balance correction methods

Paper develops methods for estimating GLMs and SNR under proportional asymptotics.

problem Estimation of regression coefficients and SNR in high-dimensional GLMs.
method Method-of-Moments type estimators that bypass nuisance function estimation.
result Consistent and asymptotically normal estimators derived for targets of inference.

We rigorously prove statistical physics predictions for non-convex GLMs in high dimensions.

problem Analyzing high-dimensional optimization problems in non-convex Generalized Linear Models.
method Developed a systematic framework using the Gaussian Min-Max Theorem and AMP to rigorously prove replica-symmetric formulas.
result Validated statistical physics predictions for non-convex GLMs, aligning with physicist's conjectures.

We consider the problem of efficiently computing the maximum likelihood estimator in Generalized Linear Models (GLMs) when the number of observations is much larger than the number of coefficients (np1n \gg p \gg 1). In this regime, optimization algorithms can immensely benefit from approximate second order information.…

2015-11-28abs ↗pdf ↗

This paper introduces a novel online inference method for high-dimensional GLMs.

problem Real-time analysis of sequentially collected data in high-dimensional settings.
method Adaptive stochastic gradient descent with online debiasing for dynamic objective functions.
result Established the asymptotic normality of the Adaptive Debiased Lasso (ADL) estimator.

Generalized Linear Models (GLM) form a wide class of regression and classification models, where prediction is a function of a linear combination of the input variables. For statistical inference in high dimension, sparsity inducing regularizations have proven to be useful while offering statistical guarantees. However…

2019-07-12abs ↗pdf ↗

New method simplifies Bayesian analysis for categorical data.

problem Difficulties in scaling GLMs for categorical data due to non-conjugacy or posterior dependencies.
method Defining CB models with binary approximations for tractable inference.
result Fast and scalable inference for thousands of categories, outperforming competitors.

Study improves model fit by transferring info from related datasets.

problem Improving model fit on target data using source data.
method Proposes a transfer learning algorithm for GLMs, derives error bounds, and introduces detection of informative sources.
result Theoretical and practical improvements over classical methods in high-dimensional GLM settings.

We consider the recently proposed reinforcement learning (RL) framework of Contextual Markov Decision Processes (CMDP), where the agent interacts with a (potentially adversarial) sequence of episodic tabular MDPs. In addition, a context vector determining the MDP parameters is available to the agent at the start of eac…

2019-03-14abs ↗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.