We propose and study the problem of distribution-preserving lossy compression. Motivated by recent advances in extreme image compression which allow to maintain artifact-free reconstructions even at very low bitrates, we propose to optimize the rate-distortion tradeoff under the constraint that the reconstructed sample…
On-device research index
arXiv research
A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.
169,051 papers · 148 categories
Trend · papers per month
21 results for “bitrate”
FRAE compresses speech data efficiently with low bitrate.
problem Online compression of sequential data with temporal dependency.
method Feedback Recurrent AutoEncoder architecture with learned prior and entropy coder.
result Achieves high-quality speech waveforms at low fixed bitrate and variable bitrate.
Paper investigates trade-off between video bitrate and CNN accuracy.
problem Network bandwidth and energy consumption issues in video classification.
method Only retain motion vector and select texture information at reduced bitrates.
result Achieved 11%-94% saving in bitrate with marginal accuracy loss.
New hierarchical VQ-VAE scheme improves image compression quality and features at low bitrates.
problem Low bitrate image compression maintaining quality and features.
method Hierarchical VQ-VAE with stochastic quantization and Markovian latent variables.
result High perceptual quality and semantic features at low bitrates.
Study connects compressed signal to AWGN model for risk estimation.
problem Estimating high-dimensional signals under compression constraints.
method Utilizes Gaussian approximation and Wasserstein distance to relate compressed and noisy signals.
result Establishes a connection between estimator risks under different conditions.
A new method compresses point clouds efficiently, outperforming existing techniques.
problem Efficiently compressing large point cloud datasets for VR applications.
method Learned convolutional transforms and uniform quantization for joint rate and distortion optimization.
result Significant rate-distortion improvement (51.5% BDBR savings) on Microsoft Voxelized Upper Bodies dataset.
DiffC compresses images by diffusing Gaussian noise, outperforming state-of-the-art methods.
problem Efficient lossy image compression without transform coding.
method Unconditional diffusion generative models to encode and denoise corrupted pixels.
result DiffC outperforms HiFiC on ImageNet 64x64, achieving a 3 dB gain at high bitrates.
New method reduces FL communication cost by leveraging server's side information.
problem High communication cost in federated learning.
method Exploits server's side information to compress client updates.
result Up to 82 times smaller bitrate with higher accuracy.
Learned Video Compressioneess.IV
New video compression algorithm outperforms existing codecs.
problem Efficient video compression with low latency.
method End-to-end learned video coding architecture.
result Significantly outperforms existing codecs across bitrate ranges.
SA-ABR uses UAV sensor data to optimize video streaming quality.
problem Dynamic UAV flight states cause fluctuating video streaming quality.
method SA-ABR integrates sensor data with network observations to train a DRL model.
result SA-ABR outperforms existing ABR algorithms by 21.4% in QoE.
Deep Video Precodingeess.IV
Deep learning improves video coding efficiency without client-side changes.
problem Improving video coding efficiency without altering existing standards.
method Cascaded downscaling neural networks coupled with adaptive precoding mode selection.
result 15% to 45% rate reduction in FHD and UHD content encoding.
We present a machine learning-based approach to lossy image compression which outperforms all existing codecs, while running in real-time. Our algorithm typically produces files 2.5 times smaller than JPEG and JPEG 2000, 2 times smaller than WebP, and 1.7 times smaller than BPG on datasets of generic images across all …
Bayesian SHMM models speech units from unannotated speech.
problem Discover latent speech units from unannotated data.
method Bayesian Subspace Hidden Markov Model (SHMM).
result System performs well on synthesis quality, lower bitrate.
A simple method compresses neural network weights using entropy penalties.
problem Neural network weight compression for scalability and accuracy.
method Reparameterization with learned entropy penalty for compression.
result Maximized classification accuracy and model compressibility.
Paper compresses neural network weight-updates for image artifacts removal.
problem Efficiently compressing neural network weight-updates for image artifacts removal.
method Fine-tuning a pre-trained artifact removal network on target data with a compression objective that encourages sparse and quantized weight-updates.
result Achieves reconstruction quality comparable to traditional codecs at comparable bitrates.
A new method improves maximum inner product search by locally decomposing residual vectors.
problem Maximum inner product search efficiency and accuracy.
method Local Orthogonal Decomposition (LOD) combined with multiscale quantization.
result LOD consistently achieves higher recall than previous methods under the same bitrates.
Sparse random networks reduce communication in federated learning.
problem Large communication cost in federated learning.
method Freeze random weights, train stochastic binary mask to sparsify.
result Improves accuracy, reduces communication, speeds convergence.
Understanding Entropy Coding With Asymmetric Numeral Systems (ANS): a Statistician's Perspectivestat.ML
This paper simplifies ANS for statisticians, making it easier to use.
problem Statisticians struggle to understand ANS and its versatility.
method Present ANS from a latent variable model perspective and guide step-by-step implementation.
result Made ANS more accessible for statisticians through a Python implementation and library.
This paper develops a method to estimate the rate-distortion function for general data sources.
problem Estimating the rate-distortion function for general data sources.
method Develops an algorithm for sandwiching the R-D function of a general (not necessarily discrete) source using i.i.d. data samples.
result Estimates R-D sandwich bounds for various data sources, including natural images, indicating potential for improving compression methods.
A two-step approach efficiently selects hyperparameters for FCMs.
problem Efficiently selecting hyperparameters for FCMs in a computationally expensive process.
method Two-step sequential approach: first estimate context length k, then estimate α.
result The proposed method achieves comparable compression performance to exhaustive search but with reduced computational cost.
Differentially quantized gradient methods improve convergence in noisy communication channels.
problem Optimizing distributed learning with limited communication bandwidth and noise.
method Introduces Differential Quantization (DQ) to compensate for quantization errors in gradient descent.
result DQ-GD achieves the same contraction factor as unquantized GD at high bitrates, proving asymptotic optimality.