Systems | Information | Learning | Optimization
 

Sequential Testing in High Dimensions | Relaxations for Production Planning Problems with Increasing By-products

Matt’s talk: Title: Sequential Testing in High Dimensions Sequential methods make use of information as it becomes available, creating an interactive connection between a sampling procedure and information gathered by that procedure. In this talk we explore sequential methods applied to sparse recovery problems, motivated by applications in both communications …

Using a New Nonconvex Singular Value Regularizer in Multivariate Linear Regression | Traffic-Redundancy Aware Network Design

*** Hongbo’s talk: Title: Using a New Nonconvex Singular Value Regularizer in Multivariate Linear Regression. We introduce the weighted singlar value penalization, which uses a nonconvex nonseparable regularizer. We show that in spite of the nonconvexity, one optimization problem with this regularizer is efficiently solvable. Applied to Multivariate Linear Regression, …

Using sparse coding to find independent components of conflict | Convex Quadratic Programming with Variable Bounds

***Bryan: Both cognitive constraints and limited amounts of data restrict the complexity of inferential models. Sparse coding is an elegant way to address these restrictions, extracting correlated subparts from data in a way that can be efficient, predictive, and adaptive. We present a sparse coding method for use on binary …

Group Symmetry and Covariance Regularization | Incredible Machines: Body, Brain and Robot.

*** Pari’s talk: Title: Group Symmetry and Covariance Regularization Statistical models that possess symmetry arise in diverse settings such as random fields associated to geophysical phenomena, exchangeable processes in Bayesian statistics, and cyclostationary processes in engineering. We formalize the notion of a symmetric model via group invariance. We propose projection …

Approaches to integrate diverse data types: applications to inferring functional regulatory networks

Transcriptional regulatory networks are networks of genes and transcription factor proteins that determine the context-specific expression pattern of a gene, where a context could represent a time point, a spatial location or a combination of these. Although these networks are a key to accurate information processing and function in living …

The Least-Squares Invertible Constant-Q Spectrogram (LSICQS) and Its Application to Phase Vocoding | Human Semi-Supervised Learning

*** Atul’s talk: Title: The Least-Squares Invertible Constant-Q Spectrogram (LSICQS) and Its Application to Phase Vocoding Building on the idea of a constant-Q transform popularized by Judith Brown in the 1990’s, we will develop a constant-Q spectrogram representation which is invertible in a least-squares sense. We will see that the …

Co-clustering for directed graphs: an algorithm, a model, and some asymptotic.

Although the network clustering literature has focused on undirected networks, many networks are directed. For example, communication networks contain asymmetric relationships, representing the flow of information from one person to another. This talk will (1) demonstrate that co-clustering, instead of clustering, is more natural for many directed graphs, (2) propose …

Harmonic Analysis for Risk Minimization on Coset Trees | Symmetry and spatiotemporal chaos with strong scale separation

*** Philip Poon Title: Symmetry and spatiotemporal chaos with strong scale separation I will discuss the effect of a continuous symmetry on pattern formation in one spatial dimension. In particular, I will present a study of the Nikolaevskiy equation, a sixth-order PDE, which is a paradigmatic model for pattern dynamics …