2021 IEEE International Conference on Acoustics, Speech and Signal Processing

6-11 June 2021 • Toronto, Ontario, Canada

Extracting Knowledge from Information

2021 IEEE International Conference on Acoustics, Speech and Signal Processing

6-11 June 2021 • Toronto, Ontario, Canada

Extracting Knowledge from Information
Login Paper Search My Schedule Paper Index Help

My ICASSP 2021 Schedule

Note: Your custom schedule will not be saved unless you create a new account or login to an existing account.
  1. Create a login based on your email (takes less than one minute)
  2. Perform 'Paper Search'
  3. Select papers that you desire to save in your personalized schedule
  4. Click on 'My Schedule' to see the current list of selected papers
  5. Click on 'Printable Version' to create a separate window suitable for printing (the header and menu will appear, but will not actually print)

Paper Detail

Paper IDMLSP-32.2
Paper Title Minimizing Weighted Concave Impurity Partition Under Constraints
Authors Thuan Nguyen, Thinh Nguyen, Oregon State University, United States
SessionMLSP-32: Optimization Algorithms for Machine Learning
LocationGather.Town
Session Time:Thursday, 10 June, 15:30 - 16:15
Presentation Time:Thursday, 10 June, 15:30 - 16:15
Presentation Poster
Topic Machine Learning for Signal Processing: [MLR-LEAR] Learning theory and algorithms
IEEE Xplore Open Preview  Click here to view in IEEE Xplore
Abstract Set partitioning is a key component of many algorithms in machine learning, signal processing, and communications. In general, the problem of finding a partition that minimizes a given impurity (loss function) is NP-hard. As such, there exists a wealth of literature on approximate algorithms and theoretical analysis for the partitioning problem under different settings. In this paper, we formulate and solve a variant of the partition problem called the minimum weighted concave impurity partition under constraint (MIPUC). MIPUC finds an optimal partition that minimizes a given weighted concave loss function under a given concave constraint. MIPUC generalizes the recently proposed Deterministic Information Bottleneck problem which finds an optimal partition that maximizes the mutual information between the input and partitioned output while minimizing the partitioned output entropy. Our proposed algorithm is based on an optimality condition, which allows us to find a locally optimal solution efficiently. We also show that the optimal partitions are separated by some hyperplanes in the space of posterior probability mass functions.