Demo Data from VLDB 2026 / reviewers in the wild / expert
Yoshitomo Matsubara
dblp:194/5593
· DBLP profile ↗
8ranked-venue papers
6as first author
4since 2021 · last 2025
0000-0002-5620-0760ORCID · verified
Domains — the database's venue-derived domains; a paper can count in several
Graphics, computer vision, multimedia, augmented reality and games · 3 · 3 first-author · 2 since 2021Artificial intelligence and machine learning · 2 · 2 first-authorComputer networks · 2 · 1 first-author · 1 since 2021Systems, architecture and hardware · 1 · 1 since 2021Databases, data management, data science and information retrieval · 1 · 1 first-author
Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.
| Artificial intelligence
1 paper |
Question answering and dialogue systems · 100% | |
| Databases, data mining, and information retrieval
1 paper |
Information retrieval · 100% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Natural language and speech › Question answering and dialogue systems › community question answering
answer selection |
0.4 | 1 | 2020 | Reranking for Efficient Transformer-based Answer Selection · SIGIR 2020 |
Natural language and speech › Question answering and dialogue systems › answer extraction
answer sentence selection |
0.4 | 1 | 2020 | Reranking for Efficient Transformer-based Answer Selection · SIGIR 2020 |
Information retrieval › reranking
neural re-ranking |
0.4 | 1 | 2020 | Reranking for Efficient Transformer-based Answer Selection · SIGIR 2020 |
Information retrieval
reranking |
0.4 | 1 | 2020 | Reranking for Efficient Transformer-based Answer Selection · SIGIR 2020 |
Methods — techniques the papers use, named apart from their topics
transformer · 0.9neural reranker · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | A Multi-Task Supervised Compression Model for Split ComputingabstractSplit computing (≠ split learning) is a promising approach to deep learning models for resource-constrained edge computing systems, where weak sensor (mobile) devices are wirelessly connected to stronger edge servers through channels with limited communication capacity. State-of-the-art work on split computing presents methods for single tasks such as image classification, object detection, or semantic segmentation. The application of existing methods to multi-task problems degrades model accuracy and/or significantly increase runtime latency. In this study, we propose Ladon, the first multi-task-head supervised compression model for multi-task split computing.11Code and models are available at https://github.com/yoshitomo-matsubara/ladon-multi-task-sc2 Experimental results show that the multi-task supervised compression model either outperformed or rivaled strong lightweight baseline models in terms of predictive performance for ILSVRC 2012, COCO 2017, and PASCAL VOC 2012 datasets while learning compressed representations at its early layers. Furthermore, our models reduced end-to-end latency (by up to 95.4%) and energy consumption of mobile devices (by up to 88.2%) in multi-task split computing scenarios. Yoshitomo Matsubara, Matteo Mendula, Marco Levorato |
WACV | 1 |
| 2023 | SplitBeam: Effective and Efficient Beamforming in Wi-Fi Networks Through Split ComputingabstractModern IEEE 802.11 (Wi-Fi) networks extensively rely on multiple-input multiple-output (MIMO) to significantly improve throughput. To correctly beamform MIMO transmissions, the access point needs to frequently acquire a beamforming matrix (BM) from each connected station. However, the size of the matrix grows with the number of antennas and subcarriers, resulting in an increasing amount of airtime overhead and computational load at the station. Conventional approaches come with either excessive computational load or loss of beamforming precision. For this reason, we propose SplitBeam, a new framework where we train a split deep neural network (DNN) to directly output the BM given the channel state information (CSI) matrix as input. The DNN is designed with an additional “bottleneck” layer to “split” the original DNN into a head model and a tail model, respectively executed by the station and the access point. The head model generates a compressed representation of the BM, which is then used by the AP to produce the BM using the tail model. We formulate and solve a bottleneck optimization problem (BOP) to keep computation, airtime overhead, and bit error rate (BER) below application requirements. We perform extensive experimental CSI collection with off-the-shelf Wi-Fi devices in two distinct environments and compare the performance of SplitBeam with the standard IEEE 802.11 algorithm for BM feedback and the state-of-the-art DNN-based approach LB-SciFi. Our experimental results show that SplitBeam reduces the beamforming feedback size and computational complexity by respectively up to 81 % and 84 % while maintaining BER within about 10−3of existing approaches. We also implement the SplitBeam DNNs on FPGA hardware to estimate the end-to-end BM reporting delay, and show that the latter is less than 10 milliseconds in the most complex scenario, which is the target channel sounding frequency in realistic multi-user MIMO scenarios. To allow full reproducibility, we will release our code and datasets to the community. Niloofar Bahadori, Yoshitomo Matsubara, Marco Levorato, Francesco Restuccia 0001 |
ICDCS | 2 |
| 2022 | Supervised Compression for Resource-Constrained Edge Computing SystemsabstractThere has been much interest in deploying deep learning algorithms on low-powered devices, including smart-phones, drones, and medical sensors. However, full-scale deep neural networks are often too resource-intensive in terms of energy and storage. As a result, the bulk part of the machine learning operation is therefore often carried out on an edge server, where the data is compressed and transmitted. However, compressing data (such as images) leads to transmitting information irrelevant to the supervised task. Another popular approach is to split the deep network between the device and the server while compressing intermediate features. To date, however, such split computing strategies have barely outperformed the aforementioned naive data compression baselines due to their inefficient approaches to feature compression. This paper adopts ideas from knowledge distillation and neural image compression to compress intermediate feature representations more efficiently. Our supervised compression approach uses a teacher model and a student model with a stochastic bottleneck and learnable prior for entropy coding (Entropic Student). We compare our approach to various neural image and feature compression baselines in three vision tasks and found that it achieves better supervised rate-distortion performance while maintaining smaller end-to-end latency. We furthermore show that the learned feature representations can be tuned to serve multiple downstream tasks. Yoshitomo Matsubara, Ruihan Yang, Marco Levorato, Stephan Mandt |
WACV | 1 |
| 2022 | BottleFit: Learning Compressed Representations in Deep Neural Networks for Effective and Efficient Split ComputingabstractAlthough mission-critical applications require the use of deep neural networks (DNNs), their continuous execution at mobile devices results in a significant increase in energy consumption. While edge offloading can decrease energy consumption, erratic patterns in channel quality, network and edge server load can lead to severe disruption of the system’s key operations. An alternative approach, called split computing, generates compressed representations within the model (called "bottlenecks"), to reduce bandwidth usage and energy consumption. Prior work has proposed approaches that introduce additional layers, to the detriment of energy consumption and latency. For this reason, we propose a new framework called BottleFit, which, in addition to targeted DNN architecture modifications, includes a novel training strategy to achieve high accuracy even with strong compression rates. We apply BottleFit on cutting-edge DNN models in image classification, and show that BottleFit achieves 77.1% data compression with up to 0.6% accuracy loss on ImageNet dataset, while state of the art such as SPINN loses up to 6% in accuracy. We experimentally measure the power consumption and latency of an image classification application running on an NVIDIA Jetson Nano board (GPU-based) and a Raspberry PI board (GPU-less). We show that BottleFit decreases power consumption and latency respectively by up to 49% and 89% with respect to (w.r.t.) local computing and by 37% and 55% w.r.t. edge offloading. We also compare BottleFit with state-of-the-art autoencoders-based approaches, and show that (i) BottleFit reduces power consumption and execution time respectively by up to 54% and 44% on the Jetson and 40% and 62% on Raspberry PI; (ii) the size of the head model executed on the mobile device is 83 times smaller. We publish the code repository for reproducibility of the results in this study. Yoshitomo Matsubara, Davide Callegaro, Sameer Singh 0001, Marco Levorato, Francesco Restuccia 0001 |
WoWMoM | 1 |
| 2020 | Optimal Task Allocation for Time-Varying Edge Computing Systems with Split DNNsabstractMany modern applications rely on complex machine learning algorithms, such as Deep Neural Networks (DNNs), to analyze images. However, both mobile and edge computing strategies may fail to provide satisfactory performance in some parameter regions. To mitigate this issue, the research community recently proposed methods to split the execution of DNNs to optimize the balance between computing load allocation and channel usage. Building on this set of results, this paper presents an optimization framework that enables the dynamic control of how images are processed in mobile device-edge server systems. The system is modeled as a Markov process, and a Linear Fractional Program is defined to identify the optimal stationary state-action distribution minimizing the overall average inference time under a constraint on the number of discarded images. Results indicate the advantage of using a dynamic control strategy with respect to available fixed strategies. Davide Callegaro, Yoshitomo Matsubara, Marco Levorato |
GLOBECOM | 2 |
| 2020 | Neural Compression and Filtering for Edge-assisted Real-time Object Detection in Challenged NetworksabstractThe edge computing paradigm places compute-capable devices - edge servers - at the network edge to assist mobile devices in executing data analysis tasks. Intuitively, offloading compute-intense tasks to edge servers can reduce their execution time. However, poor conditions of the wireless channel connecting the mobile devices to the edge servers may degrade the overall capture-to-output delay achieved by edge offloading. Herein, we focus on edge computing supporting remote object detection by means of Deep Neural Networks (DNNs), and develop a framework to reduce the amount of data transmitted over the wireless link. The core idea we propose builds on recent approaches splitting DNNs into sections - namely head and tail models - executed by the mobile device and edge server, respectively. The wireless link, then, is used to transport the output of the last layer of the head model to the edge server, instead of the DNN input. Most prior work focuses on classification tasks and leaves the DNN structure unaltered. Herein, our focus is on DNNs for three different object detection tasks, which present a much more convoluted structure, and modify the architecture of the network to: (i) achieve in-network compression by introducing a bottleneck layer in the early layers on the head model, and (ii) prefilter pictures that do not contain objects of interest using a convolutional neural network. Results show that the proposed technique represents an effective intermediate option between local and edge computing in a parameter region where these extreme point solutions fail to provide satisfactory performance. The code and trained models are available at https://github.com/yoshitomo-matsubaralhnd-ghnd-object-detectors. Yoshitomo Matsubara, Marco Levorato |
ICPR | 1 |
| 2020 | Reranking for Efficient Transformer-based Answer SelectionabstractIR-based Question Answering (QA) systems typically use a sentence selector to extract the answer from retrieved documents. Recent studies have shown that powerful neural models based on the Transformer can provide an accurate solution to Answer Sentence Selection (AS2). Unfortunately, their computation cost prevents their use in real-world applications. In this paper, we show that standard and efficient neural rerankers can be used to reduce the amount of sentence candidates fed to Transformer models without hurting Accuracy, thus improving efficiency up to four times. This is an important finding as the internal representation of shallower neural models is dramatically different from the one used by a Transformer model, e.g., word vs. contextual embeddings. Yoshitomo Matsubara, Thuy Vu, Alessandro Moschitti |
SIGIR | 1 |
| 2016 | Screen Unlocking by Spontaneous Flick Reactions with One-Class Classification ApproachesabstractPhysical biometrics technologies are introduced to the login process on smart devices. However, many of them have several disadvantages: requirement of embedding special sensor, limited environment to use and copy of key information for authentication. In this research, we proposed a new biometrics technique which can capture user's inimitable behavioral features in his/her spontaneous flick reactions on a touch-screen display for unlocking the device when it wakes up. For practical use of the technique, we adopted one-class classification approaches and they achieved about 1-2% EERs for 2500 samples from 50 subjects. Yoshitomo Matsubara, Haruhiko Nishimura, Toshiharu Samura, Hiroyuki Yoshimoto, Ryohei Tanimoto |
ICMLA | 1 |