- Signal and System Modeling, Representation and Estimation
- Multirate Signal Processing
- Sampling and Reconstruction
- Nonlinear Systems and Signal Processing
- Filter Design
- Adaptive Signal Processing
- Statistical Signal Processing

- Read more about NODE-SCREENING TESTS FOR THE L0-PENALIZED LEAST-SQUARES PROBLEM
- Log in to post comments

We present a novel screening methodology to safely discard irrelevant nodes within a generic branch-and-bound (BnB) algorithm solving the l0-penalized least-squares problem. Our contribution is a set of two simple tests to detect sets of feasible vectors that cannot yield optimal solutions. This allows to prune nodes of the BnB search tree, thus reducing the overall optimization time. One cornerstone of our contribution is a nesting property between tests at different nodes that allows to implement them with a low computational cost.

## poster.pdf

- Categories:

- Read more about NODE-SCREENING TESTS FOR THE L0-PENALIZED LEAST-SQUARES PROBLEM
- Log in to post comments

We present a novel screening methodology to safely discard irrelevant nodes within a generic branch-and-bound (BnB) algorithm solving the l0-penalized least-squares problem. Our contribution is a set of two simple tests to detect sets of feasible vectors that cannot yield optimal solutions. This allows to prune nodes of the BnB search tree, thus reducing the overall optimization time. One cornerstone of our contribution is a nesting property between tests at different nodes that allows to implement them with a low computational cost.

## slides.pdf

- Categories:

- Read more about Fast and Stable Convergence of Online SGD for CV@R-based Risk-Aware Statistical Learning
- Log in to post comments

- Categories:

- Read more about Sparse time-frequency representation via atomic norm minimization
- Log in to post comments

- Categories:

Many information sources are not just sequences of distinguishable symbols but rather have invariances governed by alternative counting paradigms such as permutations, combinations, and partitions. We consider an entire classification of these invariances called the twelvefold way in enumerative combinatorics and develop a method to characterize lossless compression limits. Explicit computations for all twelve settings are carried out for i.i.d. uniform and Bernoulli distributions. Comparisons among settings provide quantitative insight.

- Categories:

- Read more about UNSUPERVISED AUTO-ENCODING MULTIPLE-OBJECT TRACKER FOR CONSTRAINT-CONSISTENT COMBINATORIAL PROBLEM
- Log in to post comments

Multiple-object tracking (MOT) and classification are core technologies for processing moving point clouds in radar or lidar applications. For accurate object classification, the one-to-one association relationship between the model of each objects' motion (trackers) and the observation sequences including auxiliary features (e.g., radar cross section) is important.

- Categories:

- Read more about UNSUPERVISED AUTO-ENCODING MULTIPLE-OBJECT TRACKER FOR CONSTRAINT-CONSISTENT COMBINATORIAL PROBLEM
- Log in to post comments

Multiple-object tracking (MOT) and classification are core technologies for processing moving point clouds in radar or lidar applications. For accurate object classification, the one-to-one association relationship between the model of each objects' motion (trackers) and the observation sequences including auxiliary features (e.g., radar cross section) is important.

- Categories:

- Categories: