default search action
Yasutoshi Ida
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j5]Yasuhiro Fujiwara
, Atsutoshi Kumagai
Efficient Algorithm for K-Multiple-Means. Proc. ACM Manag. Data 2(1): 18:1-18:26 (2024) - [j4]Sekitoshi Kanai
Relationship Between Nonsmoothness in Adversarial Training, Constraints of Attacks, and Flatness in the Input Space. IEEE Trans. Neural Networks Learn. Syst. 35(8): 10817-10831 (2024) - [i11]Sekitoshi Kanai, Yasutoshi Ida, Kazuki Adachi, Mihiro Uchida, Tsukasa Yoshida, Shin'ya Yamaguchi:
Evaluating Time-Series Training Dataset through Lens of Spectrum in Deep State Space Models. CoRR abs/2408.16261 (2024) - 2023
- [j3]Yasuhiro Fujiwara
Efficient Network Representation Learning via Cluster Similarity. Data Sci. Eng. 8(3): 279-291 (2023) - [c27]Yasutoshi Ida, Sekitoshi Kanai, Kazuki Adachi
Fast Regularized Discrete Optimal Transport with Group-Sparse Regularizers. AAAI 2023: 7980-7987 - [c26]Kentaro Ohno, Sekitoshi Kanai, Yasutoshi Ida:
Fast Saturating Gate for Learning Long Time Scales with Recurrent Neural Networks. AAAI 2023: 9319-9326 - [c25]Yasutoshi Ida, Sekitoshi Kanai, Atsutoshi Kumagai:
Fast Block Coordinate Descent for Non-Convex Group Regularizations. AISTATS 2023: 2481-2493 - [c24]Yasuhiro Fujiwara, Yasutoshi Ida, Atsutoshi Kumagai, Masahiro Nakano, Akisato Kimura, Naonori Ueda:
Efficient Network Representation Learning via Cluster Similarity. DASFAA (3) 2023: 297-307 - [c23]Sekitoshi Kanai, Shin'ya Yamaguchi, Masanori Yamada, Hiroshi Takahashi, Kentaro Ohno, Yasutoshi Ida:
One-vs-the-Rest Loss to Focus on Important Samples in Adversarial Training. ICML 2023: 15669-15695 - [i10]Yasutoshi Ida, Sekitoshi Kanai, Kazuki Adachi, Atsutoshi Kumagai, Yasuhiro Fujiwara:
Fast Regularized Discrete Optimal Transport with Group-Sparse Regularizers. CoRR abs/2303.07597 (2023) - 2022
- [c22]Yasuhiro Fujiwara, Masahiro Nakano, Atsutoshi Kumagai, Yasutoshi Ida, Akisato Kimura, Naonori Ueda:
Fast Binary Network Hashing via Graph Clustering. IEEE Big Data 2022: 381-388 - [c21]Daiki Chijiwa, Shin'ya Yamaguchi, Atsutoshi Kumagai, Yasutoshi Ida:
Meta-ticket: Finding optimal subnetworks for few-shot learning within randomly initialized neural networks. NeurIPS 2022 - [c20]Atsutoshi Kumagai, Tomoharu Iwata, Yasutoshi Ida, Yasuhiro Fujiwara:
Few-shot Learning for Feature Selection with Hilbert-Schmidt Independence Criterion. NeurIPS 2022 - [i9]Daiki Chijiwa, Shin'ya Yamaguchi, Atsutoshi Kumagai, Yasutoshi Ida:
Meta-ticket: Finding optimal subnetworks for few-shot learning within randomly initialized neural networks. CoRR abs/2205.15619 (2022) - [i8]Sekitoshi Kanai, Shin'ya Yamaguchi, Masanori Yamada, Hiroshi Takahashi, Yasutoshi Ida:
Switching One-Versus-the-Rest Loss to Increase the Margin of Logits for Adversarial Robustness. CoRR abs/2207.10283 (2022) - [i7]Kentaro Ohno, Sekitoshi Kanai, Yasutoshi Ida:
Fast Saturating Gate for Learning Long Time Scales with Recurrent Neural Networks. CoRR abs/2210.01348 (2022) - 2021
- [b1]Yasutoshi Ida:
Algorithms for Accelerating Machine Learning with Wide and Deep Models. Kyoto University, Japan, 2021 - [j2]Yasuhiro Fujiwara, Sekitoshi Kanai, Yasutoshi Ida, Atsutoshi Kumagai, Naonori Ueda:
Fast Algorithm for Anchor Graph Hashing. Proc. VLDB Endow. 14(6): 916-928 (2021) - [c19]Yasuhiro Fujiwara, Yasutoshi Ida, Atsutoshi Kumagai, Sekitoshi Kanai, Naonori Ueda:
Fast and Accurate Anchor Graph-based Label Prediction. CIKM 2021: 504-513 - [c18]Yasuhiro Fujiwara, Yasutoshi Ida, Sekitoshi Kanai, Atsutoshi Kumagai, Naonori Ueda:
Fast Similarity Computation for t-SNE. ICDE 2021: 1691-1702 - [c17]Sekitoshi Kanai, Masanori Yamada, Shin'ya Yamaguchi, Hiroshi Takahashi, Yasutoshi Ida:
Constraining Logits by Bounded Function for Adversarial Robustness. IJCNN 2021: 1-8 - [c16]Daiki Chijiwa, Shin'ya Yamaguchi, Yasutoshi Ida, Kenji Umakoshi, Tomohiro Inoue:
Pruning Randomly Initialized Neural Networks with Iterative Randomization. NeurIPS 2021: 4503-4513 - [i6]Sekitoshi Kanai, Masanori Yamada, Hiroshi Takahashi, Yuki Yamanaka, Yasutoshi Ida:
Smoothness Analysis of Loss Functions of Adversarial Training. CoRR abs/2103.01400 (2021) - [i5]Daiki Chijiwa, Shin'ya Yamaguchi, Yasutoshi Ida, Kenji Umakoshi, Tomohiro Inoue:
Pruning Randomly Initialized Neural Networks with Iterative Randomization. CoRR abs/2106.09269 (2021) - 2020
- [c15]Sekitoshi Kanai, Yasutoshi Ida, Yasuhiro Fujiwara, Masanori Yamada, Shuichi Adachi:
Absum: Simple Regularization Method for Reducing Structural Sensitivity of Convolutional Neural Networks. AAAI 2020: 4394-4403 - [c14]Yasutoshi Ida, Sekitoshi Kanai, Yasuhiro Fujiwara, Tomoharu Iwata, Koh Takeuchi, Hisashi Kashima:
Fast Deterministic CUR Matrix Decomposition with Accuracy Assurance. ICML 2020: 4594-4603 - [c13]Yasutoshi Ida, Yasuhiro Fujiwara:
Improving Generalization Performance of Adaptive Learning Rate by Switching from Block Diagonal Matrix Preconditioning to SGD. IJCNN 2020: 1-8 - [c12]Yasuhiro Fujiwara, Atsutoshi Kumagai, Sekitoshi Kanai, Yasutoshi Ida, Naonori Ueda:
Efficient Algorithm for the b-Matching Graph. KDD 2020: 187-197 - [i4]Sekitoshi Kanai, Masanori Yamada, Shin'ya Yamaguchi, Hiroshi Takahashi, Yasutoshi Ida:
Constraining Logits by Bounded Function for Adversarial Robustness. CoRR abs/2010.02558 (2020)
2010 – 2019
- 2019
- [c11]Yasuhiro Fujiwara, Sekitoshi Kanai, Junya Arai, Yasutoshi Ida, Naonori Ueda:
Efficient Data Point Pruning for One-Class SVM. AAAI 2019: 3590-3597 - [c10]Yasuhiro Fujiwara, Yasutoshi Ida, Sekitoshi Kanai, Atsutoshi Kumagai, Junya Arai, Naonori Ueda:
Fast Random Forest Algorithm via Incremental Upper Bound. CIKM 2019: 2205-2208 - [c9]Yasutoshi Ida, Yasuhiro Fujiwara:
Network Implosion: Effective Model Compression for ResNets via Static Layer Pruning and Retraining. IJCNN 2019: 1-8 - [c8]Yasutoshi Ida, Yasuhiro Fujiwara, Hisashi Kashima:
Fast Sparse Group Lasso. NeurIPS 2019: 1700-1708 - [i3]Yasutoshi Ida, Yasuhiro Fujiwara:
Network Implosion: Effective Model Compression for ResNets via Static Layer Pruning and Retraining. CoRR abs/1906.03826 (2019) - [i2]Sekitoshi Kanai, Yasutoshi Ida, Yasuhiro Fujiwara, Masanori Yamada, Shuichi Adachi:
Absum: Simple Regularization Method for Reducing Structural Sensitivity of Convolutional Neural Networks. CoRR abs/1909.08830 (2019) - 2018
- [c7]Yasuhiro Fujiwara, Junya Arai, Sekitoshi Kanai, Yasutoshi Ida, Naonori Ueda:
Adaptive Data Pruning for Support Vector Machines. IEEE BigData 2018: 683-692 - 2017
- [c6]Yasutoshi Ida, Yasuhiro Fujiwara, Sotetsu Iwamura:
Adaptive Learning Rate via Covariance Matrix Based Preconditioning for Deep Neural Networks. IJCAI 2017: 1923-1929 - 2016
- [j1]Yasuhiro Fujiwara, Yasutoshi Ida, Junya Arai, Mai Nishimura, Sotetsu Iwamura:
Fast Algorithm for the Lasso based L1-Graph Construction. Proc. VLDB Endow. 10(3): 229-240 (2016) - [c5]Yasuhiro Fujiwara, Yasutoshi Ida, Hiroaki Shiokawa, Sotetsu Iwamura:
Fast Lasso Algorithm via Selective Coordinate Descent. AAAI 2016: 1561-1567 - [i1]Yasutoshi Ida, Yasuhiro Fujiwara, Sotetsu Iwamura:
Controlling Exploration Improves Training for Deep Neural Networks. CoRR abs/1605.09593 (2016) - 2015
- [c4]Yasuhiro Fujiwara, Makoto Nakatsuji, Hiroaki Shiokawa, Yasutoshi Ida, Machiko Toyoda:
Adaptive Message Update for Fast Affinity Propagation. KDD 2015: 309-318 - 2013
- [c3]Yasutoshi Ida, Takuma Nakamura, Takashi Matsumoto:
Label-Related/Unrelated Topic Switching Model: A Partially Labeled Topic Model Handling Infinite Label-Unrelated Topics. ACPR 2013: 892-896 - [c2]Yasutoshi Ida, Takuma Nakamura, Takashi Matsumoto:
Domain-dependent/independent topic switching model for online reviews with numerical ratings. CIKM 2013: 229-238 - 2012
- [c1]Tomohiko Suzuki, Takuma Nakamura, Yasutoshi Ida, Takashi Matsumoto:
Handling incomplete matrix data via continuous-valued infinite relational model. ICASSP 2012: 2153-2156
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-07 22:06 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: