## 2015 |

Elvira, Victor; Martino, Luca; Luengo, David; Corander, Jukka A Gradient Adaptive Population Importance Sampler Inproceedings 2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), pp. 4075–4079, IEEE, Brisbane, 2015, ISBN: 978-1-4673-6997-8. Abstract | Links | BibTeX | Tags: adaptive extensions, adaptive importance sampler, Adaptive importance sampling, gradient adaptive population, gradient matrix, Hamiltonian Monte Carlo, Hessian matrices, Hessian matrix, learning (artificial intelligence), Machine learning, MC methods, Monte Carlo, Monte Carlo methods, population Monte Carlo (PMC), proposal densities, Signal processing, Sociology, statistics, target distribution @inproceedings{Elvira2015a, title = {A Gradient Adaptive Population Importance Sampler}, author = {Victor Elvira and Luca Martino and David Luengo and Jukka Corander}, url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=7178737 http://www.tsc.uc3m.es/~velvira/papers/ICASSP2015_elvira.pdf}, doi = {10.1109/ICASSP.2015.7178737}, isbn = {978-1-4673-6997-8}, year = {2015}, date = {2015-04-01}, booktitle = {2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP)}, pages = {4075--4079}, publisher = {IEEE}, address = {Brisbane}, abstract = {Monte Carlo (MC) methods are widely used in signal processing and machine learning. A well-known class of MC methods is composed of importance sampling and its adaptive extensions (e.g., population Monte Carlo). In this paper, we introduce an adaptive importance sampler using a population of proposal densities. The novel algorithm dynamically optimizes the cloud of proposals, adapting them using information about the gradient and Hessian matrix of the target distribution. Moreover, a new kind of interaction in the adaptation of the proposal densities is introduced, establishing a trade-off between attaining a good performance in terms of mean square error and robustness to initialization.}, keywords = {adaptive extensions, adaptive importance sampler, Adaptive importance sampling, gradient adaptive population, gradient matrix, Hamiltonian Monte Carlo, Hessian matrices, Hessian matrix, learning (artificial intelligence), Machine learning, MC methods, Monte Carlo, Monte Carlo methods, population Monte Carlo (PMC), proposal densities, Signal processing, Sociology, statistics, target distribution}, pubstate = {published}, tppubtype = {inproceedings} } Monte Carlo (MC) methods are widely used in signal processing and machine learning. A well-known class of MC methods is composed of importance sampling and its adaptive extensions (e.g., population Monte Carlo). In this paper, we introduce an adaptive importance sampler using a population of proposal densities. The novel algorithm dynamically optimizes the cloud of proposals, adapting them using information about the gradient and Hessian matrix of the target distribution. Moreover, a new kind of interaction in the adaptation of the proposal densities is introduced, establishing a trade-off between attaining a good performance in terms of mean square error and robustness to initialization. |

## 2013 |

Koch, Tobias; Kramer, Gerhard On Noncoherent Fading Relay Channels at High Signal-to-Noise Ratio Journal Article IEEE Transactions on Information Theory, 59 (4), pp. 2221–2241, 2013, ISSN: 0018-9448. Abstract | Links | BibTeX | Tags: channel capacity, Channel models, Fading, fading channels, MIMO communication, multiple-input single-output fading channel statis, noncoherent, noncoherent fading relay channel capacity, radio receiver, radio receivers, radio transmitter, radio transmitters, Receivers, relay channels, relay networks (telecommunication), Relays, Signal to noise ratio, signal-to-noise ratio, SNR, statistics, time selective, Transmitters, Upper bound @article{Koch2013a, title = {On Noncoherent Fading Relay Channels at High Signal-to-Noise Ratio}, author = {Tobias Koch and Gerhard Kramer}, url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=6378474}, issn = {0018-9448}, year = {2013}, date = {2013-01-01}, journal = {IEEE Transactions on Information Theory}, volume = {59}, number = {4}, pages = {2221--2241}, abstract = {The capacity of noncoherent regular-fading relay channels is studied where all terminals are aware of the fading statistics but not of their realizations. It is shown that if the fading coefficient of the channel between the transmitter and the receiver can be predicted more accurately from its infinite past than the fading coefficient of the channel between the relay and the receiver, then at high signal-to-noise ratio (SNR), the relay does not increase capacity. It is further shown that if the fading coefficient of the channel between the transmitter and the relay can be predicted more accurately from its infinite past than the fading coefficient of the channel between the relay and the receiver, then at high SNR, one can achieve communication rates that are within one bit of the capacity of the multiple-input single-output fading channel that results when the transmitter and the relay can cooperate.}, keywords = {channel capacity, Channel models, Fading, fading channels, MIMO communication, multiple-input single-output fading channel statis, noncoherent, noncoherent fading relay channel capacity, radio receiver, radio receivers, radio transmitter, radio transmitters, Receivers, relay channels, relay networks (telecommunication), Relays, Signal to noise ratio, signal-to-noise ratio, SNR, statistics, time selective, Transmitters, Upper bound}, pubstate = {published}, tppubtype = {article} } The capacity of noncoherent regular-fading relay channels is studied where all terminals are aware of the fading statistics but not of their realizations. It is shown that if the fading coefficient of the channel between the transmitter and the receiver can be predicted more accurately from its infinite past than the fading coefficient of the channel between the relay and the receiver, then at high signal-to-noise ratio (SNR), the relay does not increase capacity. It is further shown that if the fading coefficient of the channel between the transmitter and the relay can be predicted more accurately from its infinite past than the fading coefficient of the channel between the relay and the receiver, then at high SNR, one can achieve communication rates that are within one bit of the capacity of the multiple-input single-output fading channel that results when the transmitter and the relay can cooperate. |

## 2010 |

Djuric, Petar M; Miguez, Joaquin Assessment of Nonlinear Dynamic Models by Kolmogorov–Smirnov Statistics Journal Article IEEE Transactions on Signal Processing, 58 (10), pp. 5069–5079, 2010, ISSN: 1053-587X. Abstract | Links | BibTeX | Tags: Cumulative distributions, discrete random variables, dynamic nonlinear models, Electrical capacitance tomography, Filtering, filtering theory, Iron, Kolmogorov-Smirnov statistics, Kolomogorov–Smirnov statistics, model assessment, nonlinear dynamic models, nonlinear dynamical systems, Permission, predictive cumulative distributions, predictive distributions, Predictive models, Random variables, Robots, statistical analysis, statistical distributions, statistics, Telecommunication control @article{Djuric2010a, title = {Assessment of Nonlinear Dynamic Models by Kolmogorov–Smirnov Statistics}, author = {Petar M Djuric and Joaquin Miguez}, url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=5491124}, issn = {1053-587X}, year = {2010}, date = {2010-01-01}, journal = {IEEE Transactions on Signal Processing}, volume = {58}, number = {10}, pages = {5069--5079}, abstract = {Model assessment is a fundamental problem in science and engineering and it addresses the question of the validity of a model in the light of empirical evidence. In this paper, we propose a method for the assessment of dynamic nonlinear models based on empirical and predictive cumulative distributions of data and the Kolmogorov-Smirnov statistics. The technique is based on the generation of discrete random variables that come from a known discrete distribution if the entertained model is correct. We provide simulation examples that demonstrate the performance of the proposed method.}, keywords = {Cumulative distributions, discrete random variables, dynamic nonlinear models, Electrical capacitance tomography, Filtering, filtering theory, Iron, Kolmogorov-Smirnov statistics, Kolomogorov–Smirnov statistics, model assessment, nonlinear dynamic models, nonlinear dynamical systems, Permission, predictive cumulative distributions, predictive distributions, Predictive models, Random variables, Robots, statistical analysis, statistical distributions, statistics, Telecommunication control}, pubstate = {published}, tppubtype = {article} } Model assessment is a fundamental problem in science and engineering and it addresses the question of the validity of a model in the light of empirical evidence. In this paper, we propose a method for the assessment of dynamic nonlinear models based on empirical and predictive cumulative distributions of data and the Kolmogorov-Smirnov statistics. The technique is based on the generation of discrete random variables that come from a known discrete distribution if the entertained model is correct. We provide simulation examples that demonstrate the performance of the proposed method. |

## 2009 |

Djuric, Petar M; Miguez, Joaquin Model Assessment with Kolmogorov-Smirnov Statistics Inproceedings 2009 IEEE International Conference on Acoustics, Speech and Signal Processing, pp. 2973–2976, IEEE, Taipei, 2009, ISSN: 1520-6149. Abstract | Links | BibTeX | Tags: Bayesian methods, Computer Simulation, Context modeling, Electronic mail, Filtering, ill-conditioned problem, Kolmogorov-Smirnov statistics, model assessment, modelling, Predictive models, Probability, statistical analysis, statistics, Testing @inproceedings{Djuric2009, title = {Model Assessment with Kolmogorov-Smirnov Statistics}, author = {Petar M Djuric and Joaquin Miguez}, url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=4960248}, issn = {1520-6149}, year = {2009}, date = {2009-01-01}, booktitle = {2009 IEEE International Conference on Acoustics, Speech and Signal Processing}, pages = {2973--2976}, publisher = {IEEE}, address = {Taipei}, abstract = {One of the most basic problems in science and engineering is the assessment of a considered model. The model should describe a set of observed data and the objective is to find ways of deciding if the model should be rejected. It seems that this is an ill-conditioned problem because we have to test the model against all the possible alternative models. In this paper we use the Kolmogorov-Smirnov statistic to develop a test that shows if the model should be kept or it should be rejected. We explain how this testing can be implemented in the context of particle filtering. We demonstrate the performance of the proposed method by computer simulations.}, keywords = {Bayesian methods, Computer Simulation, Context modeling, Electronic mail, Filtering, ill-conditioned problem, Kolmogorov-Smirnov statistics, model assessment, modelling, Predictive models, Probability, statistical analysis, statistics, Testing}, pubstate = {published}, tppubtype = {inproceedings} } One of the most basic problems in science and engineering is the assessment of a considered model. The model should describe a set of observed data and the objective is to find ways of deciding if the model should be rejected. It seems that this is an ill-conditioned problem because we have to test the model against all the possible alternative models. In this paper we use the Kolmogorov-Smirnov statistic to develop a test that shows if the model should be kept or it should be rejected. We explain how this testing can be implemented in the context of particle filtering. We demonstrate the performance of the proposed method by computer simulations. |

Maiz, Cristina S; Miguez, Joaquin; Djuric, Petar M Particle Filtering in the Presence of Outliers Inproceedings 2009 IEEE/SP 15th Workshop on Statistical Signal Processing, pp. 33–36, IEEE, Cardiff, 2009, ISBN: 978-1-4244-2709-3. Abstract | Links | BibTeX | Tags: computer simulations, Degradation, Filtering, multidimensional random variates, Multidimensional signal processing, Multidimensional systems, Nonlinear tracking, Outlier detection, predictive distributions, Signal processing, signal processing tools, signal-power observations, spatial depth, statistical analysis, statistical distributions, statistics, Target tracking, Testing @inproceedings{Maiz2009, title = {Particle Filtering in the Presence of Outliers}, author = {Cristina S Maiz and Joaquin Miguez and Petar M Djuric}, url = {http://ieeexplore.ieee.org/lpdocs/epic03/wrapper.htm?arnumber=5278645}, isbn = {978-1-4244-2709-3}, year = {2009}, date = {2009-01-01}, booktitle = {2009 IEEE/SP 15th Workshop on Statistical Signal Processing}, pages = {33--36}, publisher = {IEEE}, address = {Cardiff}, abstract = {Particle filters have become very popular signal processing tools for problems that involve nonlinear tracking of an unobserved signal of interest given a series of related observations. In this paper we propose a new scheme for particle filtering when the observed data are possibly contaminated with outliers. An outlier is an observation that has been generated by some (unknown) mechanism different from the assumed model of the data. Therefore, when handled in the same way as regular observations, outliers may drastically degrade the performance of the particle filter. To address this problem, we introduce an auxiliary particle filtering scheme that incorporates an outlier detection step. We propose to implement it by means of a test involving statistics of the predictive distributions of the observations. Specifically, we investigate the use of a proposed statistic called spatial depth that can easily be applied to multidimensional random variates. The performance of the resulting algorithm is assessed by computer simulations of target tracking based on signal-power observations.}, keywords = {computer simulations, Degradation, Filtering, multidimensional random variates, Multidimensional signal processing, Multidimensional systems, Nonlinear tracking, Outlier detection, predictive distributions, Signal processing, signal processing tools, signal-power observations, spatial depth, statistical analysis, statistical distributions, statistics, Target tracking, Testing}, pubstate = {published}, tppubtype = {inproceedings} } Particle filters have become very popular signal processing tools for problems that involve nonlinear tracking of an unobserved signal of interest given a series of related observations. In this paper we propose a new scheme for particle filtering when the observed data are possibly contaminated with outliers. An outlier is an observation that has been generated by some (unknown) mechanism different from the assumed model of the data. Therefore, when handled in the same way as regular observations, outliers may drastically degrade the performance of the particle filter. To address this problem, we introduce an auxiliary particle filtering scheme that incorporates an outlier detection step. We propose to implement it by means of a test involving statistics of the predictive distributions of the observations. Specifically, we investigate the use of a proposed statistic called spatial depth that can easily be applied to multidimensional random variates. The performance of the resulting algorithm is assessed by computer simulations of target tracking based on signal-power observations. |

## 2008 |

Koch, Tobias; Lapidoth, Amos On Multipath Fading Channels at High SNR Inproceedings 2008 IEEE International Symposium on Information Theory, pp. 1572–1576, IEEE, Toronto, 2008, ISBN: 978-1-4244-2256-2. Abstract | Links | BibTeX | Tags: channel capacity, Delay, discrete time systems, discrete-time channels, Entropy, Fading, fading channels, Frequency, Mathematical model, multipath channels, multipath fading channels, noncoherent channel model, Random variables, Signal to noise ratio, signal-to-noise ratios, SNR, statistics, Transmitters @inproceedings{Koch2008, title = {On Multipath Fading Channels at High SNR}, author = {Tobias Koch and Amos Lapidoth}, url = {http://ieeexplore.ieee.org/articleDetails.jsp?arnumber=4595252}, isbn = {978-1-4244-2256-2}, year = {2008}, date = {2008-01-01}, booktitle = {2008 IEEE International Symposium on Information Theory}, pages = {1572--1576}, publisher = {IEEE}, address = {Toronto}, abstract = {This paper studies the capacity of discrete-time multipath fading channels. It is assumed that the number of paths is finite, i.e., that the channel output is influenced by the present and by the L previous channel inputs. A noncoherent channel model is considered where neither transmitter nor receiver are cognizant of the fading's realization, but both are aware of its statistic. The focus is on capacity at high signal-to-noise ratios (SNR). In particular, the capacity pre-loglog-defined as the limiting ratio of the capacity to loglog(SNR) as SNR tends to infinity-is studied. It is shown that, irrespective of the number of paths L, the capacity pre-loglog is 1.}, keywords = {channel capacity, Delay, discrete time systems, discrete-time channels, Entropy, Fading, fading channels, Frequency, Mathematical model, multipath channels, multipath fading channels, noncoherent channel model, Random variables, Signal to noise ratio, signal-to-noise ratios, SNR, statistics, Transmitters}, pubstate = {published}, tppubtype = {inproceedings} } This paper studies the capacity of discrete-time multipath fading channels. It is assumed that the number of paths is finite, i.e., that the channel output is influenced by the present and by the L previous channel inputs. A noncoherent channel model is considered where neither transmitter nor receiver are cognizant of the fading's realization, but both are aware of its statistic. The focus is on capacity at high signal-to-noise ratios (SNR). In particular, the capacity pre-loglog-defined as the limiting ratio of the capacity to loglog(SNR) as SNR tends to infinity-is studied. It is shown that, irrespective of the number of paths L, the capacity pre-loglog is 1. |

Koch, Tobias; Lapidoth, Amos Multipath Channels of Unbounded Capacity Inproceedings 2008 IEEE 25th Convention of Electrical and Electronics Engineers in Israel, pp. 640–644, IEEE, Eilat, 2008, ISBN: 978-1-4244-2481-8. Abstract | Links | BibTeX | Tags: channel capacity, discrete-time capacity, Entropy, Fading, fading channels, Frequency, H infinity control, Information rates, multipath channels, multipath fading channels, noncoherent, noncoherent capacity, path gains decay, Signal to noise ratio, statistics, Transmitters, unbounded capacity @inproceedings{Koch2008b, title = {Multipath Channels of Unbounded Capacity}, author = {Tobias Koch and Amos Lapidoth}, url = {http://ieeexplore.ieee.org/articleDetails.jsp?arnumber=4736611}, isbn = {978-1-4244-2481-8}, year = {2008}, date = {2008-01-01}, booktitle = {2008 IEEE 25th Convention of Electrical and Electronics Engineers in Israel}, pages = {640--644}, publisher = {IEEE}, address = {Eilat}, abstract = {The capacity of discrete-time, noncoherent, multipath fading channels is considered. It is shown that if the variances of the path gains decay faster than exponentially, then capacity is unbounded in the transmit power.}, keywords = {channel capacity, discrete-time capacity, Entropy, Fading, fading channels, Frequency, H infinity control, Information rates, multipath channels, multipath fading channels, noncoherent, noncoherent capacity, path gains decay, Signal to noise ratio, statistics, Transmitters, unbounded capacity}, pubstate = {published}, tppubtype = {inproceedings} } The capacity of discrete-time, noncoherent, multipath fading channels is considered. It is shown that if the variances of the path gains decay faster than exponentially, then capacity is unbounded in the transmit power. |