English
Related papers

Related papers: Non-Linear Estimation of Convolutionally Encoded S…

200 papers

In this paper, we consider the problem of recovering random graph signals from nonlinear measurements. We formulate the maximum a-posteriori probability (MAP) estimator, which results in a nonconvex optimization problem. Conventional…

Signal Processing · Electrical Eng. & Systems 2024-10-28 Guy Sagi , Tirza Routtenberg

Causal discovery and inference from observational data is an essential problem in statistics posing both modeling and computational challenges. These are typically addressed by imposing strict assumptions on the joint distribution such as…

Machine Learning · Statistics 2024-02-20 Enrico Giudice , Jack Kuipers , Giusi Moffa

We introduce a model of DNA sequence evolution which can account for biases in mutation rates that depend on the identity of the neighboring bases. An analytic solution for this class of non-equilibrium models is developed by adopting…

Biological Physics · Physics 2007-05-23 Peter F. Arndt , Christopher B. Burge , Terence Hwa

One of the pivotal tasks in scientific machine learning is to represent underlying dynamical systems from time series data. Many methods for such dynamics learning explicitly require the derivatives of state data, which are not directly…

Machine Learning · Computer Science 2024-04-17 Dongwei Ye , Mengwu Guo

Many real-world decision-making tasks require learning causal relationships between a set of variables. Traditional causal discovery methods, however, require that all variables are observed, which is often not feasible in practical…

Methodology · Statistics 2023-06-27 Raj Agrawal , Chandler Squires , Neha Prasad , Caroline Uhler

Channel simulation algorithms can efficiently encode random samples from a prescribed target distribution $Q$ and find applications in machine learning-based lossy data compression. However, algorithms that encode exact samples usually have…

Information Theory · Computer Science 2024-05-16 Gergely Flamich , Lennie Wells

Noisy index coding problems over AWGN channel are considered. For a given index coding problem and a chosen scalar linear index code of length $N$, we propose to transmit the $N$ index coded bits as a single signal from a $2^N$- PSK…

Information Theory · Computer Science 2016-03-11 Anjana A. Mahesh , B. Sundar Rajan

An end-to-end learning method for constellation shaping with a shaping-encoder assisted transceiver architecture is presented. The shaping encoder, which produces shaping bits with a higher probability of zeros, is used to produce an…

Information Theory · Computer Science 2025-10-28 Harindu Jayarathne , Dileepa Marasinghe , Nandana Rajatheva , Matti Latva-aho

We consider the problem of estimating the expected value of information (the knowledge gradient) for Bayesian learning problems where the belief model is nonlinear in the parameters. Our goal is to maximize some metric, while simultaneously…

Machine Learning · Statistics 2016-11-23 Xinyu He , Warren B. Powell

Capturing multimodal natures is essential for stochastic pedestrian trajectory prediction, to infer a finite set of future trajectories. The inferred trajectories are based on observation paths and the latent vectors of potential decisions…

Computer Vision and Pattern Recognition · Computer Science 2022-05-17 Inhwan Bae , Jin-Hwi Park , Hae-Gon Jeon

We present a method by which cosmological perturbations can be quantitatively studied in single and multi-field inflationary models beyond linear perturbation theory. A non-linear generalization of the gauge-invariant Sasaki-Mukhanov…

Astrophysics · Physics 2009-11-10 G. I. Rigopoulos , E. P. S. Shellard

We consider a distributed source coding problem of $L$ correlated Gaussian observations $Y_i, i=1,2,...,L$. We assume that the random vector $Y^{L}={}^{\rm t} (Y_1,Y_2,$ $...,Y_L)$ is an observation of the Gaussian random vector…

Information Theory · Computer Science 2010-01-13 Yasutada Oohama

We introduce the truncated Gaussian graphical model (TGGM) as a novel framework for designing statistical models for nonlinear learning. A TGGM is a Gaussian graphical model (GGM) with a subset of variables truncated to be nonnegative. The…

Machine Learning · Statistics 2016-11-22 Qinliang Su , Xuejun Liao , Changyou Chen , Lawrence Carin

In decoding linear block codes, it was shown that noticeable reliability gains can be achieved by introducing learnable parameters to the Belief Propagation (BP) decoder. Despite the success of these methods, there are two key open…

Information Theory · Computer Science 2023-04-13 Sravan Kumar Ankireddy , Hyeji Kim

We develop a Bayesian approach to learning from sequential data by using Gaussian processes (GPs) with so-called signature kernels as covariance functions. This allows to make sequences of different length comparable and to rely on strong…

Machine Learning · Statistics 2020-07-07 Csaba Toth , Harald Oberhauser

In this work, with combined belief propagation (BP), mean field (MF) and expectation propagation (EP), an iterative receiver is designed for joint phase noise (PN) estimation, equalization and decoding in a coded communication system. The…

Information Theory · Computer Science 2016-09-07 Wei Wang , Zhongyong Wang , Chuanzong Zhang , Qinghua Guo , Peng Sun , Xingye Wang

Gaussian graphical models are used for determining conditional relationships between variables. This is accomplished by identifying off-diagonal elements in the inverse-covariance matrix that are non-zero. When the ratio of variables (p) to…

Applications · Statistics 2018-08-07 Donald R. Williams , Juho Piironen , Aki Vehtari , Philippe Rast

We consider the estimation of an i.i.d. (possibly non-Gaussian) vector $\xbf \in \R^n$ from measurements $\ybf \in \R^m$ obtained by a general cascade model consisting of a known linear transform followed by a probabilistic componentwise…

Information Theory · Computer Science 2012-12-04 Ulugbek S. Kamilov , Sundeep Rangan , Alyson K. Fletcher , Michael Unser

In this paper non-group permutation modulated sequences for the Gaussian channel are considered. Without the restriction to group codes rather than subsets of group codes, arbitrary rates are achievable. The code construction utilizes the…

Information Theory · Computer Science 2007-07-13 Oliver Henkel

Mean-field characterizations of first-order iterative algorithms -- including Approximate Message Passing (AMP), stochastic and proximal gradient descent, and Langevin diffusions -- have enabled a precise understanding of learning dynamics…

Statistics Theory · Mathematics 2025-07-01 Max Lovig , Tianhao Wang , Zhou Fan
‹ Prev 1 4 5 6 7 8 10 Next ›