default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDTomoumi Takase
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[j8]Tomoumi Takase
, Ryo Karakida:
Optimal layer selection for latent data augmentation. Neural Networks 181: 106753 (2025)- 2024
- [c6]Yuna Park, Tomoumi Takase, Keisuke Kameyama, Masaki Onishi:
Affinity-Weighted RandAugment for Problem-Oriented Augmentation. IJCNN 2024: 1-8 - [i3]Tomoumi Takase, Ryo Karakida:
Optimal Layer Selection for Latent Data Augmentation. CoRR abs/2408.13426 (2024) - 2023
- [j7]Tomoumi Takase:
Feature combination mixup: novel mixup method using feature combination for neural networks. Neural Comput. Appl. 35(17): 12763-12774 (2023) - [c5]Ryo Karakida, Tomoumi Takase, Tomohiro Hayase, Kazuki Osawa:
Understanding Gradient Regularization in Deep Learning: Efficient Finite-Difference Computation and Implicit Bias. ICML 2023: 15809-15827 - 2022
- [j6]Tomoumi Takase:
A Collaborative Training Using Crowdsourcing and Neural Networks on Small and Difficult Image Classification Datasets. SN Comput. Sci. 3(2): 178 (2022) - [i2]Ryo Karakida, Tomoumi Takase, Tomohiro Hayase, Kazuki Osawa:
Understanding Gradient Regularization in Deep Learning: Efficient Finite-Difference Computation and Implicit Bias. CoRR abs/2210.02720 (2022) - 2021
- [j5]Tomoumi Takase:
Dynamic batch size tuning based on stopping criterion for neural network training. Neurocomputing 429: 1-11 (2021) - [j4]Tomoumi Takase, Ryo Karakida, Hideki Asoh:
Self-paced data augmentation for training neural networks. Neurocomputing 442: 296-306 (2021) - [c4]Suguru Kanoga, Tomoumi Takase, Takayuki Hoshino, Hideki Asoh:
Time-domain Mixup Source Data Augmentation of sEMGs for Motion Recognition towards Efficient Style Transfer Mapping. EMBC 2021: 35-38 - 2020
- [i1]Tomoumi Takase, Ryo Karakida, Hideki Asoh:
Self-paced Data Augmentation for Training Neural Networks. CoRR abs/2010.15434 (2020)
2010 – 2019
- 2019
- [j3]Tomoumi Takase:
Difficulty-weighted learning: A novel curriculum-like approach based on difficult examples for neural network training. Expert Syst. Appl. 135: 83-89 (2019) - [c3]Tomoumi Takase, Satoshi Oyama, Masahito Kurihara:
Evaluation of Stratified Validation in Neural Network Training with Imbalanced Data. BigComp 2019: 1-4 - 2018
- [j2]Tomoumi Takase, Satoshi Oyama, Masahito Kurihara:
Why Does Large Batch Training Result in Poor Generalization? A Comprehensive Explanation and a Better Strategy from the Viewpoint of Stochastic Optimization. Neural Comput. 30(7) (2018) - [j1]Tomoumi Takase, Satoshi Oyama, Masahito Kurihara:
Effective neural network training with adaptive learning rate based on training loss. Neural Networks 101: 68-78 (2018) - [c2]Yukino Baba, Tomoumi Takase, Kyohei Atarashi, Satoshi Oyama, Hisashi Kashima:
Data Analysis Competition Platform for Educational Purposes: Lessons Learned and Future Challenges. AAAI 2018: 7887-7892 - [c1]Masahito Kurihara, Satoshi Oyama, Tomoumi Takase:
Longer Distance Weight Prediction for Faster Training of Neural Networks. SMC 2018: 2194-2199
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-23 21:22 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
