English
Related papers

Related papers: The stochastic geometry of unconstrained one-bit d…

200 papers

We propose geometric weighting as a novel method to combine multiple models in data compression. Our results reveal the rationale behind PAQ-weighting and generalize it to a non-binary alphabet. Based on a similar technique we present a…

Information Theory · Computer Science 2013-02-13 Christopher Mattern

With the proliferation of modern high-resolution measuring instruments mounted on satellites, planes, ground-based vehicles and monitoring stations, a need has arisen for statistical methods suitable for the analysis of large spatial…

Methodology · Statistics 2015-11-26 Matthias Katzfuss

The problem of compressing a real-valued sparse source using compressive sensing techniques is studied. The rate distortion optimality of a coding scheme in which compressively sensed signals are quantized and then reconstructed is…

Information Theory · Computer Science 2010-11-09 Rajiv Soundararajan , Sriram Vishwanath

Performance guarantees for compression in nonlinear models under non-Gaussian observations can be achieved through the use of distributional characteristics that are sensitive to the distance to normality, and which in particular return the…

Statistics Theory · Mathematics 2017-10-03 Larry Goldstein , Xiaohan Wei

This paper proposes a novel Machine Learning-based approach to solve a Poisson problem with mixed boundary conditions. Leveraging Graph Neural Networks, we develop a model able to process unstructured grids with the advantage of enforcing…

Model compression is generally performed by using quantization, low-rank approximation or pruning, for which various algorithms have been researched in recent years. One fundamental question is: what types of compression work better for a…

Machine Learning · Computer Science 2021-07-12 Miguel Á. Carreira-Perpiñán , Yerlan Idelbayev

Statistical mechanics is applied to lossy compression using multilayer perceptrons for unbiased Boolean messages. We utilize a tree-like committee machine (committee tree) and tree-like parity machine (parity tree) whose transfer functions…

Statistical Mechanics · Physics 2007-05-23 Kazushi Mimura , Masato Okada

Numerical climate model simulations run at high spatial and temporal resolutions generate massive quantities of data. As our computing capabilities continue to increase, storing all of the data is not sustainable, and thus it is important…

Methodology · Statistics 2018-02-20 Joseph Guinness , Dorit Hammerling

Non-homogeneous Poisson processes are used in a wide range of scientific disciplines, ranging from the environmental sciences to the health sciences. Often, the central object of interest in a point process is the underlying intensity…

Methodology · Statistics 2022-02-11 Tin Lok James Ng , Andrew Zammit-Mangion

We propose a novel approach for density estimation called histogram trend filtering. Our estimator arises from looking at surrogate Poisson model for counts of observations in a partition of the support of the data. We begin by showing…

Methodology · Statistics 2016-02-09 Oscar Hernan Madrid Padilla , James G. Scott

We propose a coordinate-invariant geometric formulation of the GENERIC stochastic differential equation, unifying reversible Hamiltonian and irreversible dissipative dynamics within a differential-geometric framework. Our construction…

Dynamical Systems · Mathematics 2025-10-14 Mark A. Peletier , Marcello Seri

Data-driven constitutive modeling is an emerging field in computational solid mechanics with the prospect of significantly relieving the computational costs of hierarchical computational methods. Traditionally, these surrogates have been…

Computational Engineering, Finance, and Science · Computer Science 2022-04-20 Jan Niklas Fuhg , Nikolaos Bouklas

Compressed sensing (CS) exploits the sparsity of a signal in order to integrate acquisition and compression. CS theory enables exact reconstruction of a sparse signal from relatively few linear measurements via a suitable nonlinear…

Information Theory · Computer Science 2014-09-04 Shmuel Friedland , Qun Li , Dan Schonfeld , Edgar A. Bernal

This paper demonstrates how new principles of compressed sensing, namely asymptotic incoherence, asymptotic sparsity and multilevel sampling, can be utilised to better understand underlying phenomena in practical compressed sensing and…

Functional Analysis · Mathematics 2014-07-08 Bogdan Roman , Anders Hansen , Ben Adcock

We propose a new approach for the modeling large datasets of nonstationary spatial processes that combines a latent low rank process and a sparse covariance model. The low rank component coefficients are endowed with a flexible graphical…

Methodology · Statistics 2025-10-08 Matthew LeDuc , William Kleiber , Tomoko Matsuo

Tensor decomposition on big data has attracted significant attention recently. Among the most popular methods is a class of algorithms that leverages compression in order to reduce the size of the tensor and potentially parallelize…

Machine Learning · Computer Science 2018-11-20 Georgios Tsitsikas , Evangelos E. Papalexakis

A standard approach in large scale machine learning is distributed stochastic gradient training, which requires the computation of aggregated stochastic gradients over multiple nodes on a network. Communication is a major bottleneck in such…

Distributed, Parallel, and Cluster Computing · Computer Science 2020-03-24 Hanlin Tang , Xiangru Lian , Chen Yu , Tong Zhang , Ji Liu

Statistical procedures rarely retain all features of the observed data. A sufficient statistic removes information irrelevant to a parameter; a maximum likelihood estimate compresses an empirical objective into an optimizing point; and a…

Methodology · Statistics 2026-05-27 Yuan-chin Ivan Chang

Gaussian processes (GP) are a popular and powerful tool for spatial modelling of data, especially data that quantify environmental processes. However, in stationary form, whether covariance is isotropic or anisotropic, GPs may lack the…

Methodology · Statistics 2023-11-10 Benjamin D. Youngman

In the problem of one-bit compressed sensing, the goal is to find a $\delta$-close estimation of a $k$-sparse vector $x \in \mathbb{R}^n$ given the signs of the entries of $y = \Phi x$, where $\Phi$ is called the measurement matrix. For the…

Information Theory · Computer Science 2016-09-22 Vasileios Nakos
‹ Prev 1 8 9 10 Next ›