← Search

Yuri Kinoshita

5 accepted papers

2026

Dataset Distillation Efficiently Encodes Low-Dimensional Representations from Gradient-Based Learning of Non-Linear Tasks

ICML 2026poster

Dataset distillation, a training-aware data compression technique, has recently attracted increasing attention as an effective tool for mitigating costs of optimization and data storage. However, progress remains largely empirical. Mechanisms underlying the extraction of task-relevant information fr…

Cited by 0SourceScholar
2025

Mixture of Experts Provably Detect and Learn the Latent Cluster Structure in Gradient-Based Learning

ICML 2025poster

Mixture of Experts (MoE), an ensemble of specialized models equipped with a router that dynamically distributes each input to appropriate experts, has achieved successful results in the field of machine learning. However, theoretical understanding of this architecture is falling behind due to its in…

Cited by 0SourcePDFScholar
2024

A provable control of sensitivity of neural networks through a direct parameterization of the overall bi-Lipschitzness

NeurIPS 2024poster

While neural networks can enjoy an outstanding flexibility and exhibit unprecedented performance, the mechanism behind their behavior is still not well-understood. To tackle this fundamental challenge, researchers have tried to restrict and manipulate some of their properties in order to gain new in…

2023

Controlling Posterior Collapse by an Inverse Lipschitz Constraint on the Decoder Network

ICML 2023poster

Variational autoencoders (VAEs) are one of the deep generative models that have experienced enormous success over the past decades. However, in practice, they suffer from a problem called posterior collapse, which occurs when the posterior distribution coincides, or collapses, with the prior taking…

Cited by 6SourcePDFScholar
2022

Improved Convergence Rate of Stochastic Gradient Langevin Dynamics with Variance Reduction and its Application to Optimization

NeurIPS 2022accept

The stochastic gradient Langevin Dynamics is one of the most fundamental algorithms to solve sampling problems and non-convex optimization appearing in several machine learning applications. Especially, its variance reduced versions have nowadays gained particular attention. In this paper, we study…