English
Related papers

Related papers: ARMA Processes with Discrete-Continuous Excitation…

200 papers

Understanding generalization in modern machine learning settings has been one of the major challenges in statistical learning theory. In this context, recent years have witnessed the development of various generalization bounds suggesting…

Machine Learning · Statistics 2022-07-01 Milad Sefidgaran , Amin Gohari , Gaël Richard , Umut Şimşekli

Many information systems employ lossy compression as a crucial intermediate stage among other processing components. While the important distortion is defined by the system's input and output signals, the compression usually ignores the…

Information Theory · Computer Science 2018-05-14 Yehuda Dar , Michael Elad , Alfred M. Bruckstein

Consider the problem of estimating a latent signal from a lossy compressed version of the data when the compressor is agnostic to the relation between the signal and the data. This situation arises in a host of modern applications when data…

Information Theory · Computer Science 2021-01-12 Alon Kipnis , Stefano Rini , Andrea J. Goldsmith

The information transmission rate (ITR), or effective bit rate, is a popular and widely used information measurement metric, particularly popularized for SSVEP-based Brain-Computer (BCI) interfaces. By combining speed and accuracy into a…

Human-Computer Interaction · Computer Science 2023-06-13 Suayb S. Arslan , Pawan Sinha

High-energy, large-scale particle colliders in nuclear and high-energy physics generate data at extraordinary rates, reaching up to $1$ terabyte and several petabytes per second, respectively. The development of real-time, high-throughput…

Artificial Intelligence · Computer Science 2024-12-03 Xihaier Luo , Samuel Lurvey , Yi Huang , Yihui Ren , Jin Huang , Byung-Jun Yoon

Statistical data anonymization increasingly relies on fully synthetic microdata, for which classical identity disclosure measures are less informative than an adversary's ability to infer sensitive attributes from released data. We…

Machine Learning · Computer Science 2026-02-11 Matthias Templ , Oscar Thees , Roman Müller

Sparsity is a ubiquitous feature of many real world signals such as natural images and neural spiking activities. Conventional compressed sensing utilizes sparsity to recover low dimensional signal structures in high ambient dimensions…

Statistics Theory · Mathematics 2018-07-02 Abbas Kazemipour

We introduce SIRI, Scaling Iterative Reinforcement Learning with Interleaved Compression, a simple yet effective RL approach for Large Reasoning Models (LRMs) that enables more efficient and accurate reasoning. Existing studies have…

Machine Learning · Computer Science 2025-09-30 Haoming Wen , Yushi Bai , Juanzi Li , Jie Tang

The conditional intensity (CI) of a counting process $Y_t$ is based on the minimal knowledge $\mathcal{F}_t^Y$, i.e., on the observation of $Y_t$ alone. Prominently, the mutual information rate of a signal and its Poisson channel output is…

Information Theory · Computer Science 2022-05-17 Mark Sinzger-D'Angelo , Heinz Koeppl

Radar is a critical perception modality in autonomous driving systems due to its all-weather characteristics and ability to measure range and Doppler velocity. However, the sheer volume of high-dimensional raw radar data saturates the…

Computer Vision and Pattern Recognition · Computer Science 2026-04-03 Jinho Park , Se Young Chun , Mingoo Seok

Recently, invariant risk minimization (IRM) was proposed as a promising solution to address out-of-distribution (OOD) generalization. However, it is unclear when IRM should be preferred over the widely-employed empirical risk minimization…

Machine Learning · Computer Science 2022-08-22 Kartik Ahuja , Jun Wang , Amit Dhurandhar , Karthikeyan Shanmugam , Kush R. Varshney

We propose a compressive classification framework for settings where the data dimensionality is significantly higher than the sample size. The proposed method, referred to as compressive regularized discriminant analysis (CRDA) is based on…

Machine Learning · Statistics 2020-11-13 Muhammad Naveed Tabassum , Esa Ollila

\emph{Information Dispersal Algorithms (IDAs)} have been widely applied to reliable and secure storage and transmission of data files in distributed systems. An IDA is a method that encodes a file $F$ of size $L=|F|$ into $n$ unrecognizable…

Information Theory · Computer Science 2015-03-20 Mingqiang Li

Computable Information Density (CID), the ratio of the length of a losslessly compressed data file to that of the uncompressed file, is a measure of order and correlation in both equilibrium and nonequilibrium systems. Here we show that…

Statistical Mechanics · Physics 2020-10-26 Stefano Martiniani , Yuval Lemberg , Paul M. Chaikin , Dov Levine

Extropy, a complementary dual of entropy, (proposed by Lad et al. \cite{lad2015extropy} in 2015) has attracted considerable interest from the research community. In this study, we focus on discrete random variables and define conditional…

Information Theory · Computer Science 2025-07-16 Naveen Kumar , Vivek Vijay

We explore two primary classes of approaches to dimensionality reduction (DR): Independent Dimensionality Reduction (IDR) and Simultaneous Dimensionality Reduction (SDR). In IDR methods, of which Principal Components Analysis is a…

Machine Learning · Statistics 2024-10-28 Eslam Abdelaleem , Ahmed Roman , K. Michael Martini , Ilya Nemenman

High-dimensional dense embeddings have become central to modern Information Retrieval, but many dimensions are noisy or redundant. Recently proposed DIME (Dimension IMportance Estimation), provides query-dependent scores to identify…

Information Retrieval · Computer Science 2026-04-13 Giulio D'Erasmo , Cesare Campagnano , Antonio Mallia , Pierpaolo Brutti , Nicola Tonellotto , Fabrizio Silvestri

This paper addresses the fundamental performance limits of Integrated Sensing and Communication (ISAC) systems by introducing a novel converse bound based on rate-distortion theory. This rate-distortion bound (RDB) overcomes the restrictive…

Information Theory · Computer Science 2025-10-10 Mohammadreza Bakhshizadeh Mohajer , Alex Dytso , Daniela Tuninetti , Luca Barletta

A new framework is introduced for examining and evaluating the fundamental limits of lossless data compression, that emphasizes genuinely non-asymptotic results. The {\em sample complexity} of compressing a given source is defined as the…

Information Theory · Computer Science 2026-04-16 Terence Viaud , Ioannis Kontoyiannis

Today's scientific simulations require a significant reduction of data volume because of extremely large amounts of data they produce and the limited I/O bandwidth and storage space. Error-bounded lossy compression has been considered one…

Distributed, Parallel, and Cluster Computing · Computer Science 2022-05-09 Daoce Wang , Jesus Pulido , Pascal Grosset , Sian Jin , Jiannan Tian , James Ahrens , Dingwen Tao