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

119238356475 · Jun 202019922001200920172026
48 results for multiple regression

Bayesian method corrects for model selection multiplicity in regression.

problem Model selection multiplicity in regression analysis.
method Developed a Bayesian prior distribution based on Holm procedure analogy.
result Adequate multiplicity correction requires sparsity not provided by recommended priors.

Localized sketching improves matrix multiplication and ridge regression complexity.

problem Efficiently approximate matrix multiplication and ridge regression with limited data availability.
method Localized sketching matrices for block diagonal structure, reducing sample complexity.
result Localized sketching achieves sample complexity matching global sketching methods.

Extends Gaussian Process regression for handling multiple prior distributions.

problem Handling multiple prior distributions in Bayesian Machine Learning models.
method Mixtures of Gaussian Processes with analytical and Sparse Variational approaches.
result Effective in accounting for prior misspecification in functional regression problems.

Regression problems that have closed-form solutions are well understood and can be easily implemented when the dataset is small enough to be all loaded into the RAM. Challenges arise when data is too big to be stored in RAM to compute the closed form solutions. Many techniques were proposed to overcome or alleviate the…

2019-03-03abs ↗pdf ↗

Flexible empirical Bayes for large-scale multiple linear regression.

problem Large-scale multiple linear regression with flexible priors and efficient computation.
method Adaptive shrinkage priors combined with variational approximations for hyperparameter estimation.
result The posterior mean from the empirical Bayes method solves a penalized regression problem.

New fair regression method improves fairness in chronic kidney disease classification.

problem Mitigating societal bias in health care for multiple groups.
method Penalized fair regression framework for multiple groups, with penalties for true positive rate disparity.
result Achieves fairness-accuracy frontier beyond existing methods in simulations and real-world data.

We introduce a new regression framework, Gaussian process regression networks (GPRN), which combines the structural properties of Bayesian neural networks with the non-parametric flexibility of Gaussian processes. This model accommodates input dependent signal and noise correlations between multiple response variables,…

2011-10-19abs ↗pdf ↗

This work extends the scaling law to multiple and kernel regression, challenging traditional machine learning principles.

problem Challenging traditional machine learning wisdom with scaling law in large practical models.
method Demonstrates the scaling law in multiple and kernel regression settings.
result The scaling law extends to multiple and kernel regression, providing deeper insights into LLMs.

Study introduces a new method for multiple parameter regularization in polynomial functional regression.

problem Handling varying regularization parameters in polynomial functional regression.
method Developed a theoretically grounded algorithm for multiple parameter regularization and model aggregation.
result Promising results from evaluations on synthetic and real-world data.

rMCL improves on MCL by preserving diversity in predictions for regression problems.

problem Multimodal density estimation in regression settings with multiple targets.
method rMCL uses a learned scoring scheme based on Voronoi tessellations to maintain diversity among predictions.
result rMCL outperforms existing MCL variants in sound source localization tasks.

Proposes a multivariate regression model for better analysis of multiple datasets.

problem Insufficient performance of single-dataset analysis in integrative studies.
method Sparse estimation for variable and group selection, alternating direction method of multipliers algorithm.
result Demonstrated improved performance through simulations and real data analysis.

The paper studies causal effects of multiple treatments in healthcare databases with rare outcomes.

problem Estimating causal effects of multiple treatments in healthcare databases with rare outcomes.
method The paper designs three sets of simulations and compares the operating characteristics of three types of methods: Bayesian Additive Regression Trees (BART), regression adjustment on multivariate spline of generalized propensity scores (RAMS), and inverse probability of treatment weighting (IPTW) with multinomial logistic regression or generalized boosted models.
result BART and RAMS provide lower bias and mean squared error compared to IPTW methods.

To construct flexible nonlinear predictive distributions, the paper introduces a family of softplus function based regression models that convolve, stack, or combine both operations by convolving countably infinite stacked gamma distributions, whose scales depend on the covariates. Generalizing logistic regression that…

2016-08-23abs ↗pdf ↗

A novel framework for regression with multiple experts, addressing challenges in infinite and continuous label spaces.

problem Challenges in regression with multiple experts due to the infinite and continuous nature of the label space.
method Introduces a novel framework for regression with deferral, analyzing both single-stage and two-stage scenarios with new surrogate loss functions.
result Proves HH-consistency bounds for both single-stage and two-stage methods, providing stronger guarantees than Bayes consistency.

We propose a new algorithm called PLUTO for building logistic regression trees to binary response data. PLUTO can capture the nonlinear and interaction patterns in messy data by recursively partitioning the sample space. It fits a simple or a multiple linear logistic regression model in each partition. PLUTO employs th…

2014-11-25abs ↗pdf ↗

The paper proposes a method to integrate prior information into penalized regression.

problem Improving predictive performance in high-dimensional tasks with prior information.
method Integrating multiple sources of prior information into penalized regression.
result The method improves predictive performance, as shown by simulations and applications.

This paper tackles the problem of selecting among several linear estimators in non-parametric regression; this includes model selection for linear regression, the choice of a regularization parameter in kernel ridge regression, spline smoothing or locally weighted regression, and the choice of a kernel in multiple kern…

2009-09-10abs ↗pdf ↗

The paper extends multiple instance learning to multiclass and regression problems.

problem Learning from aggregate observations where supervision is given to sets of instances.
method Probabilistic framework for various aggregate observations, including classification and regression.
result The proposed estimator has nice convergence properties under mild assumptions.

We present a probabilistic viewpoint to multiple kernel learning unifying well-known regularised risk approaches and recent advances in approximate Bayesian inference relaxations. The framework proposes a general objective function suitable for regression, robust regression and classification that is lower bound of the…

2011-03-04abs ↗pdf ↗

InVA models image outcomes from multiple modalities, outperforming standard VAEs.

problem Understanding relationships across multiple imaging modalities in neuroimaging.
method Integrative Variational Autoencoder (InVA) framework for image-on-image regression.
result InVA accurately predicts PET scans from structural MRI, outperforming conventional models.

We develop coresets for multiple ℓ_p regression problems, improving approximation sizes and efficiency.

problem Efficiently approximating multiple ℓ_p regression problems with coresets.
method Construct coresets of size sublinear in m for multiple ℓ_p regression, improving bounds for different p values.
result We construct coresets with size nearly optimal in d and independent of m for multiple ℓ_p regression.

The paper extends kernel ridge regression to product kernels and reveals new convergence behaviors.

problem Understanding kernel ridge regression in large dimensions with various kernels.
method Established a broad family of large dimensional kernels and derived convergence rates.
result Revealed new phenomena including minimax optimality, saturation effect, and multiple descent behavior.

Study on deep learning for speckle noise reduction in imaging modalities.

problem Multiplicative speckle noise challenges conventional deep learning methods for speckle denoising.
method Likelihood-based deep neural network (DNN) estimators for nonparametric regression under speckle noise.
result Established minimax rates for speckle denoising, matching those for additive Gaussian noise alone.

Logistic regression can handle noisy labels effectively when labels are imperfectly assigned by multiple experts.

problem Label noise in supervised classification due to manual labelling by multiple experts.
method Using approximate posterior probabilities of class membership from multiple experts to train logistic regression models.
result Logistic regression can be robust to label noise when classification difficulty is the only source of errors.

We detail distributed algorithms for scalable, secure multiparty linear regression and feature selection at essentially the same speed as plaintext regression. While the core geometric ideas are simple, the recognition of their broad utility when combined is novel. Our scheme opens the door to efficient and secure geno…

2019-01-28abs ↗pdf ↗

In this work, we consider a manufactory process which can be described by a multiple-instance logistic regression model. In order to compute the maximum likelihood estimation of the unknown coefficient, an expectation-maximization algorithm is proposed, and the proposed modeling approach can be extended to identify the…

2016-07-13abs ↗pdf ↗

WiGS improves active learning for regression by dynamically selecting informative samples.

problem Reducing labeling costs in regression tasks.
method Formulated as a reinforcement learning problem, WiGS adapts the exploration-investigation balance.
result WiGS outperforms static methods in accuracy and labeling efficiency, especially in irregular data density.

Adaptive algorithm for multi-objective optimization with binary constraints.

problem Optimization of black-box problems with binary constraints.
method Bayesian optimization using regression and classification models.
result Significantly faster expected hypervolume calculation.

In high-dimensional data, structured noise caused by observed and unobserved factors affecting multiple target variables simultaneously, imposes a serious challenge for modeling, by masking the often weak signal. Therefore, (1) explaining away the structured noise in multiple-output regression is of paramount importanc…

2014-10-27abs ↗pdf ↗

Tree-based algorithm for functional data analysis reduces generalization error.

problem Classification and regression problems with functional data.
method Constrained convex optimization for weighted functional L2L^{2} space, multiple splitting rules, and weighted integral features.
result Reduces generalization error while maintaining interpretability.

Kolmogorov-Arnold Networks achieve optimal convergence rates in nonparametric regression.

problem Nonparametric function approximation in multivariate settings.
method Structured additive and multiplicative KANs using B-splines.
result Achieve minimax-optimal convergence rate O(n2r/(2r+1))O(n^{-2r/(2r+1)}) for Sobolev space functions.

Efficient and accurate low-rank approximations of multiple data sources are essential in the era of big data. The scaling of kernel-based learning algorithms to large datasets is limited by the O(n^2) computation and storage complexity of the full kernel matrix, which is required by most of the recent kernel learning a…

2016-01-17abs ↗pdf ↗

New methods combine low and high-fidelity data for accurate surrogate modeling.

problem Challenges in surrogate modeling for high-dimensional outputs with limited training data.
method Projection-based multifidelity linear regression methods integrating low-fidelity and high-fidelity data.
result Multifidelity methods achieve up to 12% improvement in median accuracy compared to single-fidelity methods.