Namiko Matsumoto

According to our database, Namiko Matsumoto authored at least 6 papers between 2021 and 2025.

Collaborative distances:

• Dijkstra number of five.
• Erdős number of four.

2025

Learning sparse generalized linear models with binary outcomes via iterative hard thresholding.

Namiko Matsumoto, Arya Mazumdar

Proceedings of the Thirty Eighth Annual Conference on Learning Theory, 2025

2024

Binary Iterative Hard Thresholding Converges with Optimal Number of Measurements for 1-Bit Compressed Sensing.

Namiko Matsumoto, Arya Mazumdar

J. ACM, October, 2024

Improved Support Recovery in Universal 1-bit Compressed Sensing.

Namiko Matsumoto, Arya Mazumdar, Soumyabrata Pal

IEEE Trans. Inf. Theory, February, 2024

Robust 1-bit Compressed Sensing with Iterative Hard Thresholding.

Namiko Matsumoto, Arya Mazumdar

Proceedings of the 2024 ACM-SIAM Symposium on Discrete Algorithms, 2024

2022

Improved Support Recovery in Universal One-bit Compressed Sensing.

Namiko Matsumoto, Arya Mazumdar, Soumyabrata Pal

CoRR, 2022

2021

OnlineHD: Robust, Efficient, and Single-Pass Online Learning Using Hyperdimensional System.

Alejandro Hernández-Cane, Namiko Matsumoto, Eric Ping, Mohsen Imani

Proceedings of the Design, Automation & Test in Europe Conference & Exhibition, 2021