English
Related papers

Related papers: Collected Notes on Aldrich-Mckelevey Scaling

200 papers

In this paper we propose a variant of the linear least squares model allowing practitioners to partition the input features into groups of variables that they require to contribute similarly to the final result. The output allows…

Machine Learning · Computer Science 2024-07-17 Roberto Esposito , Mattia Cerrato , Marco Locatelli

Structured claim decomposition is often proposed as a solution for verifying complex, multi-faceted claims, yet empirical results have been inconsistent. We argue that these inconsistencies stem from two overlooked bottlenecks: evidence…

Computation and Language · Computer Science 2026-02-12 Mahmud Elahi Akhter , Federico Ruggeri , Iman Munire Bilal , Rob Procter , Maria Liakata

Here we define a procedure for evaluating KL-projections (I- and rI-projections) of channels. These can be useful in the decomposition of mutual information between input and outputs, e.g. to quantify synergies and interactions of different…

Information Theory · Computer Science 2016-09-20 Paolo Perrone , Nihat Ay

Low-rank plus diagonal (LRPD) decompositions provide a powerful structural model for large covariance matrices, simultaneously capturing global shared factors and localized corrections that arise in covariance estimation, factor analysis,…

Numerical Analysis · Mathematics 2025-12-22 Kingsley Yeon , Mihai Anitescu

We consider the problem of estimating fold-changes in the expected value of a multivariate outcome observed with unknown sample-specific and category-specific perturbations. This challenge arises in high-throughput sequencing studies of the…

Methodology · Statistics 2026-04-24 David S Clausen , Sarah Teichman , Amy D Willis

Communication has been seen as a significant bottleneck in industrial applications over large-scale networks. To alleviate the communication burden, sign-based optimization algorithms have gained popularity recently in both industrial and…

Optimization and Control · Mathematics 2021-09-07 Xiuxian Li , Kuo-Yi Lin , Li Li , Yiguang Hong , Jie Chen

A least squares semi-supervised local clustering algorithm based on the idea of compressed sensing is proposed to extract clusters from a graph with known adjacency matrix. The algorithm is based on a two-stage approach similar to the one…

Machine Learning · Computer Science 2022-11-01 Ming-Jun Lai , Zhaiming Shen

Stacking regressions is an ensemble technique that forms linear combinations of different regression estimators to enhance predictive accuracy. The conventional approach uses cross-validation data to generate predictions from the…

Machine Learning · Statistics 2024-10-10 Xin Chen , Jason M. Klusowski , Yan Shuo Tan

Organisations often struggle to identify the causes of change in metrics such as product quality and delivery duration. This task becomes increasingly challenging when the cause lies outside of company borders in multi-echelon supply chains…

Machine Learning · Computer Science 2024-08-19 Stefan Schoepf , Jack Foster , Alexandra Brintrup

Most data processing techniques, applied to biomedical and sociological time series, are only valid for random fluctuations that are stationary in time. Unfortunately, these data are often non stationary and the use of techniques of…

Data Analysis, Statistics and Probability · Physics 2009-11-10 M. Ignaccolo , P. Allegrini , P. Grigolini , P. Hamilton , B. J. West

The Cholesky decomposition plays an important role in finding the inverse of the correlation matrices. As it is a fast and numerically stable for linear system solving, inversion, and factorization compared to singular valued decomposition…

Commutative Algebra · Mathematics 2017-03-20 Vanita Pawar , Krishna Naik Karamtot

We propose a novel analysis framework for non-descent-type optimization methodologies in nonconvex scenarios based on the Kurdyka-Lojasiewicz property. Our framework allows covering a broad class of algorithms, including those commonly…

Optimization and Control · Mathematics 2024-06-05 Junwen Qiu , Bohao Ma , Xiao Li , Andre Milzarek

Low rank approximation is an important tool used in many applications of signal processing and machine learning. Recently, randomized sketching algorithms were proposed to effectively construct low rank approximations and obtain approximate…

Information Theory · Computer Science 2018-09-11 Shashanka Ubaru , Arya Mazumdar , Yousef Saad

Multiple-choice question (MCQ) benchmarks have been a standard evaluation practice for measuring LLMs' ability to reason and answer knowledge-based questions. Through a synthetic NonsenseQA benchmark, we observe that different LLMs exhibit…

Computation and Language · Computer Science 2026-02-20 Mateusz Nowak , Xavier Cadet , Peter Chin

Phase retrieval aims at recovering a complex-valued signal from magnitude-only measurements, which attracts much attention since it has numerous applications in many disciplines. However, phase recovery involves solving a system of…

Information Theory · Computer Science 2017-06-13 Wen-Jun Zeng , H. C. So

We study methods for aggregating pairwise comparison data in order to estimate outcome probabilities for future comparisons among a collection of n items. Working within a flexible framework that imposes only a form of strong stochastic…

Machine Learning · Computer Science 2016-03-23 Nihar B. Shah , Sivaraman Balakrishnan , Martin J. Wainwright

Regression analysis is an important instrument to determine the effect of the explanatory variables on response variables. When outliers and bias errors are present, the standard weighted least squares estimator may perform poorly. For this…

Computation · Statistics 2025-02-11 Justo Puerto , Alberto Torrejon

This work provides simple algorithms for multi-class (and multi-label) prediction in settings where both the number of examples n and the data dimension d are relatively large. These robust and parameter free algorithms are essentially…

Machine Learning · Computer Science 2013-10-22 Alekh Agarwal , Sham M. Kakade , Nikos Karampatziakis , Le Song , Gregory Valiant

We propose Matrix ALPS for recovering a sparse plus low-rank decomposition of a matrix given its corrupted and incomplete linear measurements. Our approach is a first-order projected gradient method over non-convex sets, and it exploits a…

Information Theory · Computer Science 2012-06-22 Anastasios Kyrillidis , Volkan Cevher

Sample-based Bayesian inference provides a route to uncertainty quantification in the geosciences, and inverse problems in general, though is very computationally demanding in the naive form that requires simulating an accurate computer…

Computation · Statistics 2019-04-12 Tiangang Cui , Colin Fox , Michael J O'Sullivan