Search Results for author: Naonori Ueda

Found 22 papers, 4 papers with code

Neural Operators Meet Energy-based Theory: Operator Learning for Hamiltonian and Dissipative PDEs

no code implementations14 Feb 2024 Yusuke Tanaka, Takaharu Yaguchi, Tomoharu Iwata, Naonori Ueda

The operator learning has received significant attention in recent years, with the aim of learning a mapping between function spaces.

Operator learning Super-Resolution

Meta-learning of Physics-informed Neural Networks for Efficiently Solving Newly Given PDEs

no code implementations20 Oct 2023 Tomoharu Iwata, Yusuke Tanaka, Naonori Ueda

We propose a neural network-based meta-learning method to efficiently solve partial differential equation (PDE) problems.

Meta-Learning

Permuton-induced Chinese Restaurant Process

1 code implementation NeurIPS 2021 Masahiro Nakano, Yasuhiro Fujiwara, Akisato Kimura, Takeshi Yamada, Naonori Ueda

Our main contribution is to introduce the notion of permutons into the well-known Chinese restaurant process (CRP) for sequence partitioning: a permuton is a probability measure on $[0, 1]\times [0, 1]$ and can be regarded as a geometric interpretation of the scaling limit of permutations.

Baxter Permutation Process

1 code implementation NeurIPS 2020 Masahiro Nakano, Akisato Kimura, Takeshi Yamada, Naonori Ueda

Compared with conventional BNP models for arbitrary RPs, the proposed model is simpler and has a high affinity with Bayesian inference.

Bayesian Inference

Translation Between Waves, wave2wave

no code implementations ICLR 2020 Tsuyoshi Okita, Hirotaka Hachiya, Sozo Inoue, Naonori Ueda

The understanding of sensor data has been greatly improved by advanced deep learning methods with big data.

Machine Translation Translation

Anomaly Detection with Inexact Labels

no code implementations11 Sep 2019 Tomoharu Iwata, Machiko Toyoda, Shotaro Tora, Naonori Ueda

We model the anomaly score function by a neural network-based unsupervised anomaly detection method, e. g., autoencoders.

Multiple Instance Learning Supervised Anomaly Detection +1

Deep Mixture Point Processes: Spatio-temporal Event Prediction with Rich Contextual Information

no code implementations21 Jun 2019 Maya Okawa, Tomoharu Iwata, Takeshi Kurashima, Yusuke Tanaka, Hiroyuki Toda, Naonori Ueda

Though many point processes have been proposed to model events in a continuous spatio-temporal space, none of them allow for the consideration of the rich contextual factors that affect event occurrence, such as weather, social activities, geographical characteristics, and traffic.

Marketing Point Processes

Fully Neural Network based Model for General Temporal Point Processes

1 code implementation NeurIPS 2019 Takahiro Omi, Naonori Ueda, Kazuyuki Aihara

We herein propose a novel RNN based model in which the time course of the intensity function is represented in a general manner.

Point Processes Time Series +1

Finding Appropriate Traffic Regulations via Graph Convolutional Networks

no code implementations23 Oct 2018 Tomoharu Iwata, Takuma Otsuka, Hitoshi Shimizu, Hiroshi Sawada, Futoshi Naya, Naonori Ueda

In this paper, we propose a method to learn a function that outputs regulation effects given the current traffic situation as inputs.

Unsupervised Object Matching for Relational Data

no code implementations9 Oct 2018 Tomoharu Iwata, Naonori Ueda

The estimated latent vectors contain hidden structural information of each object in the given relational dataset.

Density Estimation Object

Partial AUC Maximization via Nonlinear Scoring Functions

no code implementations13 Jun 2018 Naonori Ueda, Akinori Fujino

In binary classification tasks, accuracy is the most commonly used as a measure of classifier performance.

Anomaly Detection Binary Classification +2

Single-epoch supernova classification with deep convolutional neural networks

no code implementations30 Nov 2017 Akisato Kimura, Ichiro Takahashi, Masaomi Tanaka, Naoki Yasuda, Naonori Ueda, Naoki Yoshida

Our method first builds a convolutional neural network for estimating the luminance of supernovae from telescope images, and then constructs another neural network for the classification, where the estimated luminance and observation dates are used as features for classification.

Astronomy Classification +1

Multi-output Polynomial Networks and Factorization Machines

no code implementations NeurIPS 2017 Mathieu Blondel, Vlad Niculae, Takuma Otsuka, Naonori Ueda

On recommendation system tasks, we show how to combine our algorithm with a reduction from ordinal regression to multi-output classification and show that the resulting algorithm outperforms simple baselines in terms of ranking accuracy.

General Classification

Machine-learning Selection of Optical Transients in Subaru/Hyper Suprime-Cam Survey

no code implementations12 Sep 2016 Mikio Morii, Shiro Ikeda, Nozomu Tominaga, Masaomi Tanaka, Tomoki Morokuma, katsuhiko Ishiguro, Junji Yamato, Naonori Ueda, Naotaka Suzuki, Naoki Yasuda, Naoki Yoshida

We present an application of machine-learning (ML) techniques to source selection in the optical transient survey data with Hyper Suprime-Cam (HSC) on the Subaru telescope.

Instrumentation and Methods for Astrophysics

Polynomial Networks and Factorization Machines: New Insights and Efficient Training Algorithms

no code implementations29 Jul 2016 Mathieu Blondel, Masakazu Ishihata, Akinori Fujino, Naonori Ueda

Polynomial networks and factorization machines are two recently-proposed models that can efficiently use feature interactions in classification and regression tasks.

General Classification Recommendation Systems +1

Higher-Order Factorization Machines

4 code implementations NeurIPS 2016 Mathieu Blondel, Akinori Fujino, Naonori Ueda, Masakazu Ishihata

Factorization machines (FMs) are a supervised learning approach that can use second-order feature combinations even when the data is very high-dimensional.

Link Prediction

Collapsed Variational Bayes Inference of Infinite Relational Model

no code implementations16 Sep 2014 Katsuhiko Ishiguro, Issei Sato, Naonori Ueda

The Infinite Relational Model (IRM) is a probabilistic model for relational data clustering that partitions objects into clusters based on observed relationships.

Clustering

Dynamic Infinite Relational Model for Time-varying Relational Data Analysis

no code implementations NeurIPS 2010 Katsuhiko Ishiguro, Tomoharu Iwata, Naonori Ueda, Joshua B. Tenenbaum

We propose a new probabilistic model for analyzing dynamic evolutions of relational data, such as additions, deletions and split & merge, of relation clusters like communities in social networks.

Object

Modeling Social Annotation Data with Content Relevance using a Topic Model

no code implementations NeurIPS 2009 Tomoharu Iwata, Takeshi Yamada, Naonori Ueda

We propose a probabilistic topic model for analyzing and extracting content-related annotations from noisy annotated discrete data such as web pages stored in social bookmarking services.

General Classification Information Retrieval +3

Cannot find the paper you are looking for? You can Submit a new open access paper.