English
Related papers

Related papers: A tutorial on the range variant of asymmetric nume…

200 papers

The increasing prevalence of high-dimensional data demands efficient and scalable compression methods to support modern applications. However, existing techniques like PCA and Autoencoders often rely on auxiliary metadata or intricate…

Machine Learning · Computer Science 2024-12-17 Dongfang Zhao

Motivated from the fact that universal source coding on countably infinite alphabets is not feasible, this work introduces the notion of almost lossless source coding. Analog to the weak variable-length source coding problem studied by Han…

Information Theory · Computer Science 2021-11-30 Jorge F. Silva , Pablo Piantanida

Developing computationally-efficient codes that approach the Shannon-theoretic limits for communication and compression has long been one of the major goals of information and coding theory. There have been significant advances towards this…

Information Theory · Computer Science 2019-11-05 Ramji Venkataramanan , Sekhar Tatikonda , Andrew Barron

Logarithmic number systems (LNS) are used to represent real numbers in many applications using a constant base raised to a fixed-point exponent making its distribution exponential. This greatly simplifies hardware multiply, divide and…

Numerical Analysis · Mathematics 2022-01-26 Syed Asad Alam , James Garland , David Gregg

With the increasing use of nonlinear devices in both generation and consumption of power, it is essential that we develop accurate and quick control for active filters to suppress harmonics. Time delays between input and output are…

Systems and Control · Electrical Eng. & Systems 2024-10-04 Dixant Bikal Sapkota , Puskar Neupane , Kajal Pokharel , Shahabuddin Khan

A general method of coding over expansions is proposed, which allows one to reduce the highly non-trivial problem of coding over continuous channels to a much simpler discrete ones. More specifically, the focus is on the additive…

Information Theory · Computer Science 2012-02-09 O. Ozan Koyluoglu , Kumar Appaiah , Hongbo Si , Sriram Vishwanath

Resampling is an operation costly in calculation time and accuracy. It regularizes irregular sampling, replacing N data by N periodic estimations. This stage can be suppressed, using formulas built with incoming data and completed by…

Data Analysis, Statistics and Probability · Physics 2019-05-28 Bernard Lacaze

Small-angle neutron scattering (SANS) is a powerful technique for probing the nanoscale structure of materials. However, the fundamental limitations of neutron flux pose significant challenges for rapid, high-fidelity data acquisition…

The rate regions of multilevel diversity coding systems (MDCS), a sub-class of the broader family of multi-source multi-sink networks with special structure, are investigated. After showing how to enumerate all non-isomorphic MDCS instances…

Information Theory · Computer Science 2014-08-28 Congduan Li , Steven Weber , John MacLaren Walsh

This paper introduces the Adaptive Base Representation (ABR) Theorem and proposes a novel number system that offers a structured alternative to the binary number system for digital computers. The ABR number system enables each decimal…

Information Theory · Computer Science 2025-10-20 Ravin Kumar

Neural network (NN) designed for challenging machine learning tasks is in general a highly nonlinear mapping that contains massive variational parameters. High complexity of NN, if unbounded or unconstrained, might unpredictably cause…

Machine Learning · Computer Science 2025-05-23 Yong Qing , Ke Li , Peng-Fei Zhou , Shi-Ju Ran

Compressed Counting (CC) [22] was recently proposed for estimating the ath frequency moments of data streams, where 0 < a <= 2. CC can be used for estimating Shannon entropy, which can be approximated by certain functions of the ath…

Data Structures and Algorithms · Computer Science 2012-05-14 Ping Li

Recent semantic communication methods explore effective ways to expand the communication paradigm and improve the system performance of the communication systems. Nonetheless, the common problem of these methods is that the essence of…

Information Theory · Computer Science 2024-01-29 Zijian Liang , Kai Niu , Jin Xu , Ping Zhang

We propose a generic feature compression method for Approximate Nearest Neighbor Search (ANNS) problems, which speeds up existing ANNS methods in a plug-and-play manner. Specifically, based on transformer, we propose a new network structure…

Information Retrieval · Computer Science 2022-04-07 Haokui Zhang , Buzhou Tang , Wenze Hu , Xiaoyu Wang

This article is in the context of gradient compression. Gradient compression is a popular technique for mitigating the communication bottleneck observed when training large machine learning models in a distributed manner using…

Distributed, Parallel, and Cluster Computing · Computer Science 2021-08-24 Tharindu Adikari

This paper considers the problem of variable-length coding over a discrete memoryless channel (DMC) with noiseless feedback. The paper provides a stochastic control view of the problem whose solution is analyzed via a newly proposed…

Information Theory · Computer Science 2016-11-18 Mohammad Naghshvar , Tara Javidi , Michèle Wigger

Given a sufficient statistic for a parametric family of distributions, one can estimate the parameter without access to the data. However, the memory or code size for storing the sufficient statistic may nonetheless still be prohibitive.…

Information Theory · Computer Science 2017-11-17 Masahito Hayashi , Vincent Y. F. Tan

Thanks to the use of convolution and pooling layers, convolutional neural networks were for a long time thought to be shift-invariant. However, recent works have shown that the output of a CNN can change significantly with small shifts in…

Computer Vision and Pattern Recognition · Computer Science 2021-04-01 Anadi Chaman , Ivan Dokmanić

Detecting the presence of anomalies in regression models is a crucial task in machine learning, as anomalies can significantly impact the accuracy and reliability of predictions. Random Sample Consensus (RANSAC) is one of the most popular…

Machine Learning · Statistics 2024-10-22 Le Hong Phong , Ho Ngoc Luat , Vo Nguyen Le Duy

Adaptive Multilevel Splitting (AMS for short) is a generic Monte Carlo method for Markov processes that simulates rare events and estimates associated probabilities. Despite its practical efficiency, there are almost no theoretical results…

Probability · Mathematics 2018-04-24 Frédéric Cérou , Bernard Delyon , Arnaud Guyader , Mathias Rousset