37 citations · 167 across the 53 of their papers we have counts for
Showing cs.ITShow all
2 papers · 1 filter
cs.IT2025
A Dual Approach for Hierarchical Information-Theoretic Tree Abstractions
Daniel T. Larsson, Dipankar Maity, Panagiotis Tsiotras
In this paper, we consider establishing a formal connection between two distinct tree-abstraction problems inspired by the information-bottleneck (IB) method. Specifically, we cons…
cs.IT2022
A Linear Programming Approach for Resource-Aware Information-Theoretic Tree Abstractions
Daniel T. Larsson, Dipankar Maity, Panagiotis Tsiotras
In this chapter, an integer linear programming formulation for the problem of obtaining task-relevant, multi-resolution, environment abstractions for resource-constrained autonomou…