3 papers
cs.DS2026
Kd-tree Based Wasserstein Distance Approximation for High-Dimensional Data
Kanata Teshigawara, Keisho Oh, Ken Kobayashi +1
The Wasserstein distance is a discrepancy measure between probability distributions, defined by an optimal transport problem. It has been used for various tasks such as retrieving…
cs.CV2025
Content-Aware Ad Banner Layout Generation with Two-Stage Chain-of-Thought in Vision Language Models
Kei Yoshitake, Kento Hosono, Ken Kobayashi +1
In this paper, we propose a method for generating layouts for image-based advertisements by leveraging a Vision-Language Model (VLM). Conventional advertisement layout techniques h…
cs.LG2025
Interior-Point Vanishing Problem in Semidefinite Relaxations for Neural Network Verification
Ryota Ueda, Takami Sato, Ken Kobayashi +1
Semidefinite programming (SDP) relaxation has emerged as a promising approach for neural network verification, offering tighter bounds than other convex relaxation methods for deep…