Sorry, you need to enable JavaScript to visit this website.

Sequential learning; sequential decision methods (MLR-SLER)

Variational and Hierarchical Recurrent Autoencoder

Jen-Tzung Chien

Despite a great success in learning representation for image data, it is challenging to learn the stochastic latent features from natural language based on variational inference. The difficulty in stochastic sequential learning is due to the posterior collapse caused by an autoregressive decoder which is prone to be too strong to learn sufficient latent information during optimization. To compensate this weakness in learning procedure, a sophisticated latent structure is required to assure good convergence so that random features are sufficiently captured for sequential decoding.

Paper Details

Authors:
Jen-Tzung Chien
Jen-Tzung Chien and Chun-Wei Wang
Submitted On:
7 May 2019 - 8:19pm
Short Link:
Type:
Event:
Paper Code:
Document Year:
Cite

Document Files

[ICASSP 2019] Variational and hierarchical recurrent autoencoder.pdf

(13)

Icassp19_hier.pdf

(15)

Keywords

Subscribe

Send Author a Private Message
[1] Jen-Tzung Chien and Chun-Wei Wang, "Variational and Hierarchical Recurrent Autoencoder", IEEE SigPort, 2019. [Online]. Available: http://sigport.org/3968. Accessed: Jun. 24, 2019.
@article{3968-19,
url = {http://sigport.org/3968},
author = {Jen-Tzung Chien and Chun-Wei Wang },
publisher = {IEEE SigPort},
title = {Variational and Hierarchical Recurrent Autoencoder},
year = {2019} }
TY - EJOUR
T1 - Variational and Hierarchical Recurrent Autoencoder
AU - Jen-Tzung Chien and Chun-Wei Wang
PY - 2019
PB - IEEE SigPort
UR - http://sigport.org/3968
ER -
Jen-Tzung Chien and Chun-Wei Wang. (2019). Variational and Hierarchical Recurrent Autoencoder. IEEE SigPort. http://sigport.org/3968
Jen-Tzung Chien and Chun-Wei Wang, 2019. Variational and Hierarchical Recurrent Autoencoder. Available at: http://sigport.org/3968.
Jen-Tzung Chien and Chun-Wei Wang. (2019). "Variational and Hierarchical Recurrent Autoencoder." Web.
1. Jen-Tzung Chien and Chun-Wei Wang. Variational and Hierarchical Recurrent Autoencoder [Internet]. IEEE SigPort; 2019. Available from : http://sigport.org/3968

BAYESIAN QUICKEST CHANGE POINT DETECTION WITH MULTIPLE CANDIDATES OF POST-CHANGE MODELS

Samrat Nath

We study the quickest change point detection for systems with multiple possible post-change models. A change point is the time instant at which the distribution of a random process changes. We consider the case that the post-change model is from a finite set of possible models. Under the Bayesian setting, the objective is to minimize the average detection delay (ADD), subject to upper bounds on the probability of false alarm (PFA). The proposed algorithm is a threshold-based sequential test.

Paper Details

Authors:
Samrat Nath
Samrat Nath, Jingxian Wu
Submitted On:
24 November 2018 - 2:22pm
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

Change_Detection_GlobalSIP18.pdf

(56)

Keywords

Subscribe

Send Author a Private Message
[1] Samrat Nath, Jingxian Wu, "BAYESIAN QUICKEST CHANGE POINT DETECTION WITH MULTIPLE CANDIDATES OF POST-CHANGE MODELS", IEEE SigPort, 2018. [Online]. Available: http://sigport.org/3771. Accessed: Jun. 24, 2019.
@article{3771-18,
url = {http://sigport.org/3771},
author = {Samrat Nath; Jingxian Wu },
publisher = {IEEE SigPort},
title = {BAYESIAN QUICKEST CHANGE POINT DETECTION WITH MULTIPLE CANDIDATES OF POST-CHANGE MODELS},
year = {2018} }
TY - EJOUR
T1 - BAYESIAN QUICKEST CHANGE POINT DETECTION WITH MULTIPLE CANDIDATES OF POST-CHANGE MODELS
AU - Samrat Nath; Jingxian Wu
PY - 2018
PB - IEEE SigPort
UR - http://sigport.org/3771
ER -
Samrat Nath, Jingxian Wu. (2018). BAYESIAN QUICKEST CHANGE POINT DETECTION WITH MULTIPLE CANDIDATES OF POST-CHANGE MODELS. IEEE SigPort. http://sigport.org/3771
Samrat Nath, Jingxian Wu, 2018. BAYESIAN QUICKEST CHANGE POINT DETECTION WITH MULTIPLE CANDIDATES OF POST-CHANGE MODELS. Available at: http://sigport.org/3771.
Samrat Nath, Jingxian Wu. (2018). "BAYESIAN QUICKEST CHANGE POINT DETECTION WITH MULTIPLE CANDIDATES OF POST-CHANGE MODELS." Web.
1. Samrat Nath, Jingxian Wu. BAYESIAN QUICKEST CHANGE POINT DETECTION WITH MULTIPLE CANDIDATES OF POST-CHANGE MODELS [Internet]. IEEE SigPort; 2018. Available from : http://sigport.org/3771

Topological Interference Alignment via Generalized Low-Rank Optimization with Sequential Convex Approximations

Fan Zhang

Paper Details

Authors:
Fan Zhang
Fan Zhang, Qiong Wu, Hao Wang, Yuanming Shi
Submitted On:
20 June 2018 - 9:26pm
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

Topological Interference Alignment via Generalized Low-Rank Optimization with Sequential Convex Approximations

(273)

Keywords

Additional Categories

Subscribe

Send Author a Private Message
[1] Fan Zhang, Qiong Wu, Hao Wang, Yuanming Shi, "Topological Interference Alignment via Generalized Low-Rank Optimization with Sequential Convex Approximations", IEEE SigPort, 2018. [Online]. Available: http://sigport.org/3276. Accessed: Jun. 24, 2019.
@article{3276-18,
url = {http://sigport.org/3276},
author = {Fan Zhang; Qiong Wu; Hao Wang; Yuanming Shi },
publisher = {IEEE SigPort},
title = {Topological Interference Alignment via Generalized Low-Rank Optimization with Sequential Convex Approximations},
year = {2018} }
TY - EJOUR
T1 - Topological Interference Alignment via Generalized Low-Rank Optimization with Sequential Convex Approximations
AU - Fan Zhang; Qiong Wu; Hao Wang; Yuanming Shi
PY - 2018
PB - IEEE SigPort
UR - http://sigport.org/3276
ER -
Fan Zhang, Qiong Wu, Hao Wang, Yuanming Shi. (2018). Topological Interference Alignment via Generalized Low-Rank Optimization with Sequential Convex Approximations. IEEE SigPort. http://sigport.org/3276
Fan Zhang, Qiong Wu, Hao Wang, Yuanming Shi, 2018. Topological Interference Alignment via Generalized Low-Rank Optimization with Sequential Convex Approximations. Available at: http://sigport.org/3276.
Fan Zhang, Qiong Wu, Hao Wang, Yuanming Shi. (2018). "Topological Interference Alignment via Generalized Low-Rank Optimization with Sequential Convex Approximations." Web.
1. Fan Zhang, Qiong Wu, Hao Wang, Yuanming Shi. Topological Interference Alignment via Generalized Low-Rank Optimization with Sequential Convex Approximations [Internet]. IEEE SigPort; 2018. Available from : http://sigport.org/3276

Topological Interference Alignment via Generalized Low-Rank Optimization with Sequential Convex Approximations

Fan Zhang

spawc_poster.pdf

PDF icon Topological Interference Alignment via Generalized Low-Rank Optimization with Sequential Convex Approximations (273)

Paper Details

Authors:
Fan Zhang
Fan Zhang, Qiong Wu, Hao Wang, Yuanming Shi
Submitted On:
20 June 2018 - 9:26pm
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

Topological Interference Alignment via Generalized Low-Rank Optimization with Sequential Convex Approximations

(273)

Keywords

Additional Categories

Subscribe

Send Author a Private Message
[1] Fan Zhang, Qiong Wu, Hao Wang, Yuanming Shi, "Topological Interference Alignment via Generalized Low-Rank Optimization with Sequential Convex Approximations", IEEE SigPort, 2018. [Online]. Available: http://sigport.org/3275. Accessed: Jun. 24, 2019.
@article{3275-18,
url = {http://sigport.org/3275},
author = {Fan Zhang; Qiong Wu; Hao Wang; Yuanming Shi },
publisher = {IEEE SigPort},
title = {Topological Interference Alignment via Generalized Low-Rank Optimization with Sequential Convex Approximations},
year = {2018} }
TY - EJOUR
T1 - Topological Interference Alignment via Generalized Low-Rank Optimization with Sequential Convex Approximations
AU - Fan Zhang; Qiong Wu; Hao Wang; Yuanming Shi
PY - 2018
PB - IEEE SigPort
UR - http://sigport.org/3275
ER -
Fan Zhang, Qiong Wu, Hao Wang, Yuanming Shi. (2018). Topological Interference Alignment via Generalized Low-Rank Optimization with Sequential Convex Approximations. IEEE SigPort. http://sigport.org/3275
Fan Zhang, Qiong Wu, Hao Wang, Yuanming Shi, 2018. Topological Interference Alignment via Generalized Low-Rank Optimization with Sequential Convex Approximations. Available at: http://sigport.org/3275.
Fan Zhang, Qiong Wu, Hao Wang, Yuanming Shi. (2018). "Topological Interference Alignment via Generalized Low-Rank Optimization with Sequential Convex Approximations." Web.
1. Fan Zhang, Qiong Wu, Hao Wang, Yuanming Shi. Topological Interference Alignment via Generalized Low-Rank Optimization with Sequential Convex Approximations [Internet]. IEEE SigPort; 2018. Available from : http://sigport.org/3275

SEQUENTIAL MAXIMUM MARGIN CLASSIFIERS FOR PARTIALLY LABELED DATA

Elizabeth Hou

Paper Details

Authors:
Elizabeth Hou
Elizabeth Hou, Alfred O. Hero
Submitted On:
18 April 2018 - 4:55pm
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

poster.pdf

(117)

Keywords

Subscribe

Send Author a Private Message
[1] Elizabeth Hou, Alfred O. Hero, "SEQUENTIAL MAXIMUM MARGIN CLASSIFIERS FOR PARTIALLY LABELED DATA", IEEE SigPort, 2018. [Online]. Available: http://sigport.org/2973. Accessed: Jun. 24, 2019.
@article{2973-18,
url = {http://sigport.org/2973},
author = {Elizabeth Hou; Alfred O. Hero },
publisher = {IEEE SigPort},
title = {SEQUENTIAL MAXIMUM MARGIN CLASSIFIERS FOR PARTIALLY LABELED DATA},
year = {2018} }
TY - EJOUR
T1 - SEQUENTIAL MAXIMUM MARGIN CLASSIFIERS FOR PARTIALLY LABELED DATA
AU - Elizabeth Hou; Alfred O. Hero
PY - 2018
PB - IEEE SigPort
UR - http://sigport.org/2973
ER -
Elizabeth Hou, Alfred O. Hero. (2018). SEQUENTIAL MAXIMUM MARGIN CLASSIFIERS FOR PARTIALLY LABELED DATA. IEEE SigPort. http://sigport.org/2973
Elizabeth Hou, Alfred O. Hero, 2018. SEQUENTIAL MAXIMUM MARGIN CLASSIFIERS FOR PARTIALLY LABELED DATA. Available at: http://sigport.org/2973.
Elizabeth Hou, Alfred O. Hero. (2018). "SEQUENTIAL MAXIMUM MARGIN CLASSIFIERS FOR PARTIALLY LABELED DATA." Web.
1. Elizabeth Hou, Alfred O. Hero. SEQUENTIAL MAXIMUM MARGIN CLASSIFIERS FOR PARTIALLY LABELED DATA [Internet]. IEEE SigPort; 2018. Available from : http://sigport.org/2973

SELFISH LEARNING: LEVERAGING THE GREED IN SOCIAL LEARNING

Ravi Kiran Raman

We introduce a sequential Bayesian binary hypothesis testing problem under social learning, termed selfish learning, where agents work to maximize their individual rewards. In particular, each agent receives a private signal and is aware of decisions made by earlier-acting agents. Beside inferring the underlying hypothesis, agents also decide whether to stop and declare, or pass the inference to the next agent. The employer rewards only correct responses and the reward per worker decreases with the number of employees used for decision making.

Paper Details

Authors:
Ravi Kiran Raman
Ravi Kiran Raman, Srilakshmi Pattabiraman
Submitted On:
18 April 2018 - 1:02pm
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

ICASSP_draft2.pptx

(151)

Keywords

Subscribe

Send Author a Private Message
[1] Ravi Kiran Raman, Srilakshmi Pattabiraman, "SELFISH LEARNING: LEVERAGING THE GREED IN SOCIAL LEARNING", IEEE SigPort, 2018. [Online]. Available: http://sigport.org/2860. Accessed: Jun. 24, 2019.
@article{2860-18,
url = {http://sigport.org/2860},
author = {Ravi Kiran Raman; Srilakshmi Pattabiraman },
publisher = {IEEE SigPort},
title = {SELFISH LEARNING: LEVERAGING THE GREED IN SOCIAL LEARNING},
year = {2018} }
TY - EJOUR
T1 - SELFISH LEARNING: LEVERAGING THE GREED IN SOCIAL LEARNING
AU - Ravi Kiran Raman; Srilakshmi Pattabiraman
PY - 2018
PB - IEEE SigPort
UR - http://sigport.org/2860
ER -
Ravi Kiran Raman, Srilakshmi Pattabiraman. (2018). SELFISH LEARNING: LEVERAGING THE GREED IN SOCIAL LEARNING. IEEE SigPort. http://sigport.org/2860
Ravi Kiran Raman, Srilakshmi Pattabiraman, 2018. SELFISH LEARNING: LEVERAGING THE GREED IN SOCIAL LEARNING. Available at: http://sigport.org/2860.
Ravi Kiran Raman, Srilakshmi Pattabiraman. (2018). "SELFISH LEARNING: LEVERAGING THE GREED IN SOCIAL LEARNING." Web.
1. Ravi Kiran Raman, Srilakshmi Pattabiraman. SELFISH LEARNING: LEVERAGING THE GREED IN SOCIAL LEARNING [Internet]. IEEE SigPort; 2018. Available from : http://sigport.org/2860

MULTI-ARMED BANDITS FOR HUMAN-MACHINE DECISION MAKING

Paul Reverdy

Paper Details

Authors:
Paul Reverdy
Vaibhav Srivastava
Submitted On:
13 April 2018 - 3:39pm
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

Reverdy-ICASSP18.pdf

(109)

Keywords

Subscribe

Send Author a Private Message
[1] Vaibhav Srivastava, "MULTI-ARMED BANDITS FOR HUMAN-MACHINE DECISION MAKING", IEEE SigPort, 2018. [Online]. Available: http://sigport.org/2753. Accessed: Jun. 24, 2019.
@article{2753-18,
url = {http://sigport.org/2753},
author = {Vaibhav Srivastava },
publisher = {IEEE SigPort},
title = {MULTI-ARMED BANDITS FOR HUMAN-MACHINE DECISION MAKING},
year = {2018} }
TY - EJOUR
T1 - MULTI-ARMED BANDITS FOR HUMAN-MACHINE DECISION MAKING
AU - Vaibhav Srivastava
PY - 2018
PB - IEEE SigPort
UR - http://sigport.org/2753
ER -
Vaibhav Srivastava. (2018). MULTI-ARMED BANDITS FOR HUMAN-MACHINE DECISION MAKING. IEEE SigPort. http://sigport.org/2753
Vaibhav Srivastava, 2018. MULTI-ARMED BANDITS FOR HUMAN-MACHINE DECISION MAKING. Available at: http://sigport.org/2753.
Vaibhav Srivastava. (2018). "MULTI-ARMED BANDITS FOR HUMAN-MACHINE DECISION MAKING." Web.
1. Vaibhav Srivastava. MULTI-ARMED BANDITS FOR HUMAN-MACHINE DECISION MAKING [Internet]. IEEE SigPort; 2018. Available from : http://sigport.org/2753

MONTE CARLO EXPLORATION FOR ACTIVE BINAURAL LOCALIZATION

Christopher Schymura

This study introduces a machine hearing system for robot audition, which enables a robotic agent to pro-actively minimize the uncertainty of sound source location estimates through motion. The proposed system is based on an active exploration approach, providing a means to model and predict effects of the agent's future motions on localization uncertainty in a probabilistic manner. Particle filtering is used to estimate the posterior probability density function of the source position from binaural measurements, enabling to jointly assess azimuth and distance of the source.

Paper Details

Authors:
Christopher Schymura
Christopher Schymura, Juan Diego Rios Grajales, Dorothea Kolossa
Submitted On:
1 March 2017 - 5:16am
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

poster_icassp2017.pdf

(573)

Keywords

Subscribe

Send Author a Private Message
[1] Christopher Schymura, Juan Diego Rios Grajales, Dorothea Kolossa, "MONTE CARLO EXPLORATION FOR ACTIVE BINAURAL LOCALIZATION", IEEE SigPort, 2017. [Online]. Available: http://sigport.org/1543. Accessed: Jun. 24, 2019.
@article{1543-17,
url = {http://sigport.org/1543},
author = {Christopher Schymura; Juan Diego Rios Grajales; Dorothea Kolossa },
publisher = {IEEE SigPort},
title = {MONTE CARLO EXPLORATION FOR ACTIVE BINAURAL LOCALIZATION},
year = {2017} }
TY - EJOUR
T1 - MONTE CARLO EXPLORATION FOR ACTIVE BINAURAL LOCALIZATION
AU - Christopher Schymura; Juan Diego Rios Grajales; Dorothea Kolossa
PY - 2017
PB - IEEE SigPort
UR - http://sigport.org/1543
ER -
Christopher Schymura, Juan Diego Rios Grajales, Dorothea Kolossa. (2017). MONTE CARLO EXPLORATION FOR ACTIVE BINAURAL LOCALIZATION. IEEE SigPort. http://sigport.org/1543
Christopher Schymura, Juan Diego Rios Grajales, Dorothea Kolossa, 2017. MONTE CARLO EXPLORATION FOR ACTIVE BINAURAL LOCALIZATION. Available at: http://sigport.org/1543.
Christopher Schymura, Juan Diego Rios Grajales, Dorothea Kolossa. (2017). "MONTE CARLO EXPLORATION FOR ACTIVE BINAURAL LOCALIZATION." Web.
1. Christopher Schymura, Juan Diego Rios Grajales, Dorothea Kolossa. MONTE CARLO EXPLORATION FOR ACTIVE BINAURAL LOCALIZATION [Internet]. IEEE SigPort; 2017. Available from : http://sigport.org/1543

Distributed Sequence Prediction: A consensus+innovations approach

Anit Kumar Sahu

This paper focuses on the problem of distributed sequence
prediction in a network of sparsely interconnected agents,
where agents collaborate to achieve provably reasonable
predictive performance. An expert assisted online learning
algorithm in a distributed setup of the consensus+innovations
form is proposed, in which the agents update their weights
for the experts’ predictions by simultaneously processing the
latest network losses (innovations) and the cumulative losses
obtained from neighboring agents (consensus). This paper

Paper Details

Authors:
Anit Kumar Sahu
Anit Kumar Sahu, Soummya Kar
Submitted On:
6 December 2016 - 3:37am
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

GlobalSIP_talk.pdf

(341)

Keywords

Subscribe

Send Author a Private Message
[1] Anit Kumar Sahu, Soummya Kar, "Distributed Sequence Prediction: A consensus+innovations approach", IEEE SigPort, 2016. [Online]. Available: http://sigport.org/1357. Accessed: Jun. 24, 2019.
@article{1357-16,
url = {http://sigport.org/1357},
author = {Anit Kumar Sahu; Soummya Kar },
publisher = {IEEE SigPort},
title = {Distributed Sequence Prediction: A consensus+innovations approach},
year = {2016} }
TY - EJOUR
T1 - Distributed Sequence Prediction: A consensus+innovations approach
AU - Anit Kumar Sahu; Soummya Kar
PY - 2016
PB - IEEE SigPort
UR - http://sigport.org/1357
ER -
Anit Kumar Sahu, Soummya Kar. (2016). Distributed Sequence Prediction: A consensus+innovations approach. IEEE SigPort. http://sigport.org/1357
Anit Kumar Sahu, Soummya Kar, 2016. Distributed Sequence Prediction: A consensus+innovations approach. Available at: http://sigport.org/1357.
Anit Kumar Sahu, Soummya Kar. (2016). "Distributed Sequence Prediction: A consensus+innovations approach." Web.
1. Anit Kumar Sahu, Soummya Kar. Distributed Sequence Prediction: A consensus+innovations approach [Internet]. IEEE SigPort; 2016. Available from : http://sigport.org/1357

ONLINE CHANGE DETECTION OF LINEAR REGRESSION MODELS

Jun Geng

We consider the problem of quickly detecting an abrupt change of linear coefficients in linear regression models. In particular, the observer sequentially observes a sequence of observations $\{ (x_n; y_n) \}_{n=1}^{\infty}$, which is assumed to obey a linear regression model at each time slot n. Some of the coefficients in the linear model change at a fixed but unknown time $t$. The post-change linear coefficients are unknown to the observer. The observer aims to design an online algorithm to detect the model change based on his sequential observations.

Paper Details

Authors:
Jun Geng
Jun Geng, Bingwen Zhang, Lauren M. Huie, Lifeng Lai
Submitted On:
14 April 2018 - 2:11am
Short Link:
Type:
Event:
Presenter's Name:
Paper Code:
Document Year:
Cite

Document Files

Poster_ICASSP2016.pdf

(537)

Keywords

Subscribe

Send Author a Private Message
[1] Jun Geng, Bingwen Zhang, Lauren M. Huie, Lifeng Lai, "ONLINE CHANGE DETECTION OF LINEAR REGRESSION MODELS", IEEE SigPort, 2016. [Online]. Available: http://sigport.org/890. Accessed: Jun. 24, 2019.
@article{890-16,
url = {http://sigport.org/890},
author = {Jun Geng; Bingwen Zhang; Lauren M. Huie; Lifeng Lai },
publisher = {IEEE SigPort},
title = {ONLINE CHANGE DETECTION OF LINEAR REGRESSION MODELS},
year = {2016} }
TY - EJOUR
T1 - ONLINE CHANGE DETECTION OF LINEAR REGRESSION MODELS
AU - Jun Geng; Bingwen Zhang; Lauren M. Huie; Lifeng Lai
PY - 2016
PB - IEEE SigPort
UR - http://sigport.org/890
ER -
Jun Geng, Bingwen Zhang, Lauren M. Huie, Lifeng Lai. (2016). ONLINE CHANGE DETECTION OF LINEAR REGRESSION MODELS. IEEE SigPort. http://sigport.org/890
Jun Geng, Bingwen Zhang, Lauren M. Huie, Lifeng Lai, 2016. ONLINE CHANGE DETECTION OF LINEAR REGRESSION MODELS. Available at: http://sigport.org/890.
Jun Geng, Bingwen Zhang, Lauren M. Huie, Lifeng Lai. (2016). "ONLINE CHANGE DETECTION OF LINEAR REGRESSION MODELS." Web.
1. Jun Geng, Bingwen Zhang, Lauren M. Huie, Lifeng Lai. ONLINE CHANGE DETECTION OF LINEAR REGRESSION MODELS [Internet]. IEEE SigPort; 2016. Available from : http://sigport.org/890

Pages