English
Related papers

Related papers: On Channel Simulation with Causal Rejection Sample…

200 papers

A number of simplified models, based on perturbation theory, have been proposed for the fiber-optical channel and have been extensively used in the literature. Although these models are mainly developed for the low-power regime, they are…

Information Theory · Computer Science 2019-12-11 Kamran Keykhosravi , Giuseppe Durisi , Erik Agrell

Recent advances in powerful pre-trained diffusion models encourage the development of methods to improve the sampling performance under well-trained diffusion models. This paper introduces Diffusion Rejection Sampling (DiffRS), which uses a…

Machine Learning · Computer Science 2024-05-29 Byeonghu Na , Yeongmin Kim , Minsang Park , Donghyeok Shin , Wanmo Kang , Il-Chul Moon

Synthetic control (SC) methods have gained rapid popularity in economics recently, where they have been applied in the context of inferring the effects of treatments on standard continuous outcomes assuming linear input-output relations. In…

Methodology · Statistics 2024-02-19 Alicia Curth , Hoifung Poon , Aditya V. Nori , Javier González

Estimating the probabilities of rare failure events is a key challenge in the reliability analysis of physical systems. Subset simulation (SS) is a very popular adaptive Monte Carlo method for this problem. In SS, the small failure…

Computation · Statistics 2026-05-25 Oindrila Kanjilal , Julien Bect

In relative entropy coding, a sender aims to design a stochastic code such that, on input $X \sim P_X$, the receiver can generate a sample $Y \sim P_{Y \mid X}$. It is a standard result that (1) this requires at least $I(X; Y)$ bits, (2)…

Information Theory · Computer Science 2026-05-05 Spencer Hill , Fady Alajaji , Tamás Linder , Gergely Flamich

This paper considers the input-constrained binary memoryless symmetric (BMS) channel, without feedback. The channel input sequence respects the $(d,\infty)$-runlength limited (RLL) constraint, which mandates that any pair of successive $1$s…

Information Theory · Computer Science 2022-01-07 V. Arvind Rameshwar , Navin Kashyap

Stochastic encoders for channel coding and lossy source coding are introduced with a rate close to the fundamental limits, where the only restriction is that the channel input alphabet and the reproduction alphabet of the lossy source code…

Information Theory · Computer Science 2016-11-15 Jun Muramatsu

Many large-scale systems rely on high-quality deep representations (embeddings) to facilitate tasks like retrieval, search, and generative modeling. Matryoshka Representation Learning (MRL) recently emerged as a solution for adaptive…

Machine Learning · Computer Science 2025-05-21 Tiansheng Wen , Yifei Wang , Zequn Zeng , Zhong Peng , Yudi Su , Xinyang Liu , Bo Chen , Hongwei Liu , Stefanie Jegelka , Chenyu You

In the problem of channel resolvability, where a given output probability distribution via a channel is approximated by transforming the uniform random numbers, characterizing the asymptotically minimum rate of the size of the random…

Information Theory · Computer Science 2017-01-31 Hideki Yagi

Secured opportunistic Medium Access Control (MAC) and complexity reduction in channel estimation are proposed in the Cross layer design Cognitive Radio Networks deploying the secured dynamic channel allocation from the endorsed channel…

Networking and Internet Architecture · Computer Science 2012-03-19 Niraj Shakhakarmi

Causal representation learning (CRL) models aim to transform high-dimensional data into a latent space, enabling interventions to generate counterfactual samples or modify existing data based on the causal relationships among latent…

Machine Learning · Computer Science 2026-03-19 Alireza Sadeghi , Wael AbdAlmageed

We propose and study a realistic Continual Learning (CL) setting where learning algorithms are granted a restricted computational budget per time step while training. We apply this setting to large-scale semi-supervised Continual Learning…

Machine Learning · Computer Science 2024-06-11 Wenxuan Zhang , Youssef Mohamed , Bernard Ghanem , Philip H. S. Torr , Adel Bibi , Mohamed Elhoseiny

Given a probability distribution $\mathcal{D}$ over the non-negative integers, a $\mathcal{D}$-repeat channel acts on an input symbol by repeating it a number of times distributed as $\mathcal{D}$. For example, the binary deletion channel…

Information Theory · Computer Science 2022-02-08 Francisco Pernice , Ray Li , Mary Wootters

We consider a molecular channel, in which messages are encoded to the frequency of objects in a pool, and whose output during reading time is a noisy version of the input frequencies, as obtained by sampling with replacement from the pool.…

Information Theory · Computer Science 2025-04-28 Ran Tamir , Nir Weinberger

We study the problem of single-channel source separation (SCSS), and focus on cyclostationary signals, which are particularly suitable in a variety of application domains. Unlike classical SCSS approaches, we consider a setting where only…

Signal Processing · Electrical Eng. & Systems 2023-03-14 Gary C. F. Lee , Amir Weiss , Alejandro Lancho , Jennifer Tang , Yuheng Bu , Yury Polyanskiy , Gregory W. Wornell

When dealing with real-world optimization problems, decision-makers usually face high levels of uncertainty associated with partial information, unknown parameters, or complex relationships between these and the problem decision variables.…

Optimization and Control · Mathematics 2023-05-01 Antonio Alcántara , Carlos Ruiz

We consider the joint source-channel coding problem of sending a Gaussian source on a K-user Gaussian broadcast channel with bandwidth mismatch. A new outer bound to the achievable distortion region is derived using the technique of…

Information Theory · Computer Science 2010-11-22 Chao Tian , Suhas Diggavi , Shlomo Shamai

This paper investigates the problem of variable-length lossy source coding allowing a positive excess distortion probability and an overflow probability of codeword lengths. Novel one-shot achievability and converse bounds of the optimal…

Information Theory · Computer Science 2018-12-17 Shota Saito , Hideki Yagi , Toshiyasu Matsushima

Direct numerical simulations (DNS) are an indispensable tool for understanding the fundamental physics of turbulent flows. Because of their steep increase in computational cost with Reynolds number ($R_{\lambda}$), well-resolved DNS are…

Computational Physics · Physics 2020-08-26 Komal Kumari , Diego A. Donzis

Compressed Sensing (CS) is a novel technique for simultaneous signal sampling and compression based on the existence of a sparse representation of signal and a projected dictionary $PD$, where $P\in\mathbb{R}^{m\times d}$ is the projection…

Information Theory · Computer Science 2018-04-25 Canyi Lu , Huan Li , Zhouchen Lin