Dmitry M. Malioutov

2 accepted papers

2023

A Statistical Interpretation of the Maximum Subarray Problem

ICASSP 2023accepted

Maximum subarray is a classical problem in computer science that given an array of numbers aims to find a contiguous subarray with the largest sum. We focus on its use for a noisy statistical problem of localizing an interval with a mean different from background. While a naive application of maximu…

Cited by 0 Source ↗Scholar ↗

2015

Learning interpretable classification rules using sequential rowsampling

Sanjeeb Dash, Dmitry M. Malioutov, Kush R. Varshney

ICASSP 2015accepted

In our previous work we have presented an approach to learn interpretable classification rules using a Boolean compressed sensing formulation. Our approach uses a linear programming (LP) relaxation and allows us to find interpretable (sparse) classification rules that achieve good generalization acc…

Cited by 0 Source ↗Scholar ↗