English
Related papers

Related papers: Optimal Compression for Two-Field Entries in Fixed…

200 papers

Deep neural networks have achieved strong performance in image classification tasks due to their ability to learn complex patterns from high-dimensional data. However, their large computational and memory requirements often limit deployment…

Computer Vision and Pattern Recognition · Computer Science 2026-03-06 Sai Shi

We confirm a conjecture by Everett, Sinclair, and Dankelmann~[Some Centrality results new and old, J. Math. Sociology 28 (2004), 215--227] regarding the problem of maximizing closeness centralization in two-mode data, where the number of…

Combinatorics · Mathematics 2016-08-16 Matjaž Krnc , Jean-Sébastien Sereni , Riste Škrekovski , Zelealem B. Yilma

Any secured system can be modeled as a capability-based access control system in which each user is given a set of secret keys of the resources he is granted access to. In some large systems with resource-constrained devices, such as sensor…

Cryptography and Security · Computer Science 2021-09-21 Aldar C-F. Chan

The ever-increasing parameter counts of deep learning models necessitate effective compression techniques for deployment on resource-constrained devices. This paper explores the application of information geometry, the study of…

Machine Learning · Computer Science 2025-07-15 Zakhar Shumaylov , Vasileios Tsiaras , Yannis Stylianou

Distributed storage systems often introduce redundancy to increase reliability. When coding is used, the repair problem arises: if a node storing encoded information fails, in order to maintain the same level of reliability we need to…

Information Theory · Computer Science 2010-04-27 Alexandros G. Dimakis , Kannan Ramchandran , Yunnan Wu , Changho Suh

A lossy source coding problem with privacy constraint is studied in which two correlated discrete sources $X$ and $Y$ are compressed into a reconstruction $\hat{X}$ with some prescribed distortion $D$. In addition, a privacy constraint is…

Information Theory · Computer Science 2015-04-23 Farshid Mokhtarinezhad , Joerg Kliewer , Osvaldo Simeone

We study how much a linear program (LP) can be compressed when solved repeatedly, given prior knowledge about its objective function. Existing data-driven projection methods learn low-dimensional surrogate LPs with approximate…

Optimization and Control · Mathematics 2026-05-26 Yuhan Ye , Omar Bennouna

In cloud computing, storage area networks, remote backup storage, and similar settings, stored data is modified with updates from new versions. Representing information and modifying the representation are both expensive. Therefore it is…

Information Theory · Computer Science 2011-05-11 Lav R. Varshney , Julius Kusuma , Vivek K Goyal

Distributed storage systems that deploy erasure codes can provide better features such as lower storage overhead and higher data reliability. In this paper, we focus on fractional repetition (FR) codes, which are a class of storage codes…

Information Theory · Computer Science 2020-05-15 Bing Zhu , Kenneth W. Shum , Hui Li

We address the challenge of applying existing convolutional neural network (CNN) architectures to compressed images. Existing CNN architectures represent images as a matrix of pixel intensities with a specified dimension; this desired…

Computer Vision and Pattern Recognition · Computer Science 2019-11-22 Christopher A. George , Bradley M. West

Neural networks embedded in safety-sensitive applications such as self-driving cars and wearable health monitors rely on two important techniques: input attribution for hindsight analysis and network compression to reduce its size for…

Machine Learning · Computer Science 2020-10-29 Geondo Park , June Yong Yang , Sung Ju Hwang , Eunho Yang

Storing tabular data to balance storage and query efficiency is a long-standing research question in the database community. In this work, we argue and show that a novel DeepMapping abstraction, which relies on the impressive memorization…

Databases · Computer Science 2024-09-27 Lixi Zhou , K. Selçuk Candan , Jia Zou

We introduce a new and increasingly relevant setting for distributed optimization in machine learning, where the data defining the optimization are unevenly distributed over an extremely large number of nodes. The goal is to train a…

Machine Learning · Computer Science 2016-10-11 Jakub Konečný , H. Brendan McMahan , Daniel Ramage , Peter Richtárik

Second order asymptotics of fixed-length source coding and intrinsic randomness is discussed with a constant error constraint. There was a difference between optimal rates of fixed-length source coding and intrinsic randomness, which never…

Information Theory · Computer Science 2010-01-23 Masahito Hayashi

Empirically-determined scaling laws have been broadly successful in predicting the evolution of large machine learning models with training data and number of parameters. As a consequence, they have been useful for optimizing the allocation…

Computer Vision and Pattern Recognition · Computer Science 2024-07-26 Katherine L. Mentzer , Andrea Montanari

We consider the distributed source coding problem in which correlated data picked up by scattered sensors has to be encoded separately and transmitted to a common receiver, subject to a rate-distortion constraint. Although near-tooptimal…

Information Theory · Computer Science 2008-09-09 G. Maierbacher , J. Barros

Most current distributed processing research deals with improving the flexibility and convergence speed of algorithms for networks of finite size with no constraints on information sharing and no concept for expected levels of signal…

Signal Processing · Electrical Eng. & Systems 2019-12-19 Matt O'Connor , W. Bastiaan Kleijn

We consider a backhaul-constrained coordinated cellular network. That is, a single-frequency network with $N+1$ multi-antenna base stations (BSs) that cooperate in order to decode the users' data, and that are linked by means of a common…

Information Theory · Computer Science 2008-02-07 Aitor del Coso , Sebastien Simoens

Efficient compression of correlated data is essential to minimize communication overload in multi-sensor networks. In such networks, each sensor independently compresses the data and transmits them to a central node due to limited…

We propose computationally efficient encoders and decoders for lossy compression using a Sparse Regression Code. The codebook is defined by a design matrix and codewords are structured linear combinations of columns of this matrix. The…

Information Theory · Computer Science 2014-05-20 Ramji Venkataramanan , Tuhin Sarkar , Sekhar Tatikonda
‹ Prev 1 8 9 10 Next ›