← Search

Tomoya Sakai

11 accepted papers

2026

TSPulse: Tiny Pre-Trained Models with Disentangled Representations for Rapid Time-Series Analysis

ICLR 2026poster

Different time-series tasks benefit from distinct cues at various spaces and abstractions, yet existing time-series pre-trained models entangle these signals within large, monolithic embeddings, limiting transferability and zero-shot usability. Moreover, massive model sizes demand heavy compute, res…

Cited by 0SourcecodeScholar
2025

Text-Guided Few-Shot Semantic Segmentation with Training-Free Multimodal Feature Matching

ICASSP 2025accepted

This paper addresses few-shot semantic segmentation (FSS) guided by text, where we classify unseen novel classes using image and text references as in-context examples, without the need for training. We enhance the quality and stability of the segmentation masks generated by FSS by combining the cap…

Cited by 0SourceScholar
2024

A Surprisingly Simple Approach to Generalized Few-Shot Semantic Segmentation

NeurIPS 2024poster

The goal of *generalized* few-shot semantic segmentation (GFSS) is to recognize *novel-class* objects through training with a few annotated examples and the *base-class* model that learned the knowledge about the base classes. Unlike the classic few-shot semantic segmentation, GFSS aims to classify…

2024

Probabilistic Feature Matching for Fast Scalable Visual Prompting

IJCAI 2024poster

In this work, we propose a novel framework for image segmentation guided by visual prompting which leverages the power of vision foundation models. Inspired by recent advancements in computer vision, our approach integrates multiple large-scale pretrained models to address the challenges of segment…

Cited by 1SourcePDFScholar
2021

Regret Minimization for Causal Inference on Large Treatment Space

AISTATS 2021poster

Predicting which action (treatment) will lead to a better outcome is a central task in decision support systems. To build a prediction model in real situations, learning from observational data with a sampling bias is a critical issue due to the lack of randomized controlled trial (RCT) data. To han…

Cited by 16SourcePDFScholar
2020

Do We Need Zero Training Loss After Achieving Zero Training Error?

ICML 2020poster

Overparameterized deep networks have the capacity to memorize training data with zero \emph{training error}. Even after memorization, the \emph{training loss} continues to approach zero, making the model overconfident and the test performance degraded. Since existing regularizers do not directly aim…

2020

Robust modal regression with direct gradient approximation of modal regression risk

UAI 2020poster

Modal regression is aimed at estimating the global mode (i.e., global maximum) of the conditional density function of the output variable given input variables, and has led to regression methods robust against a wide-range of noises. A typical approach for modal regression takes a two-step approach…

Cited by 4SourcePDFScholar
2017

Least-Squares Log-Density Gradient Clustering for Riemannian Manifolds

AISTATS 2017poster

Mean shift is a mode-seeking clustering algorithm that has been successfully used in a wide range of applications such as image segmentation and object tracking. To further improve the clustering performance, mean shift has been extended to various directions, including generalization to handle data…

Cited by 8SourcePDFScholar
2017

Semi-Supervised Classification Based on Classification from Positive and Unlabeled Data

ICML 2017poster

Most of the semi-supervised classification methods developed so far use unlabeled data for regularization purposes under particular distributional assumptions such as the cluster assumption. In contrast, recently developed methods of classification from positive and unlabeled data (PU classification…

Cited by 138SourcePDFScholar
2016

Theoretical Comparisons of Positive-Unlabeled Learning against Positive-Negative Learning

NeurIPS 2016poster

In PU learning, a binary classifier is trained from positive (P) and unlabeled (U) data without negative (N) data. Although N data is missing, it sometimes outperforms PN learning (i.e., ordinary supervised learning). Hitherto, neither theoretical nor experimental analysis has been given to explain…

Cited by 152SourcePDFScholar
2015

Separating background and foreground optical flow fields by low-rank and sparse regularization

ICASSP 2015accepted

We present a method for separating background and foreground optical flow fields induced by observer's egomotion and motion of objects, respectively. Optical flow is a vector field of instantaneous apparent motion computed from successive images. An optical flow field can be assumed as a linear comb…

Cited by 0SourceScholar