Yasutoshi Ida

Orcid: 0000-0003-4279-9503

According to our database1, Yasutoshi Ida authored at least 36 papers between 2012 and 2024.

Collaborative distances:
  • Dijkstra number2 of five.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2024
Relationship Between Nonsmoothness in Adversarial Training, Constraints of Attacks, and Flatness in the Input Space.
IEEE Trans. Neural Networks Learn. Syst., August, 2024

Efficient Algorithm for K-Multiple-Means.
Proc. ACM Manag. Data, February, 2024

Evaluating Time-Series Training Dataset through Lens of Spectrum in Deep State Space Models.
CoRR, 2024

2023
Efficient Network Representation Learning via Cluster Similarity.
Data Sci. Eng., September, 2023

One-vs-the-Rest Loss to Focus on Important Samples in Adversarial Training.
Proceedings of the International Conference on Machine Learning, 2023

Fast Block Coordinate Descent for Non-Convex Group Regularizations.
Proceedings of the International Conference on Artificial Intelligence and Statistics, 2023

Fast Saturating Gate for Learning Long Time Scales with Recurrent Neural Networks.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

Fast Regularized Discrete Optimal Transport with Group-Sparse Regularizers.
Proceedings of the Thirty-Seventh AAAI Conference on Artificial Intelligence, 2023

2022
Switching One-Versus-the-Rest Loss to Increase the Margin of Logits for Adversarial Robustness.
CoRR, 2022

Few-shot Learning for Feature Selection with Hilbert-Schmidt Independence Criterion.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Meta-ticket: Finding optimal subnetworks for few-shot learning within randomly initialized neural networks.
Proceedings of the Advances in Neural Information Processing Systems 35: Annual Conference on Neural Information Processing Systems 2022, 2022

Fast Binary Network Hashing via Graph Clustering.
Proceedings of the IEEE International Conference on Big Data, 2022

2021
Algorithms for Accelerating Machine Learning with Wide and Deep Models.
PhD thesis, 2021

Fast Algorithm for Anchor Graph Hashing.
Proc. VLDB Endow., 2021

Smoothness Analysis of Loss Functions of Adversarial Training.
CoRR, 2021

Pruning Randomly Initialized Neural Networks with Iterative Randomization.
Proceedings of the Advances in Neural Information Processing Systems 34: Annual Conference on Neural Information Processing Systems 2021, 2021

Constraining Logits by Bounded Function for Adversarial Robustness.
Proceedings of the International Joint Conference on Neural Networks, 2021

Fast Similarity Computation for t-SNE.
Proceedings of the 37th IEEE International Conference on Data Engineering, 2021

Fast and Accurate Anchor Graph-based Label Prediction.
Proceedings of the CIKM '21: The 30th ACM International Conference on Information and Knowledge Management, Virtual Event, Queensland, Australia, November 1, 2021

2020
Efficient Algorithm for the b-Matching Graph.
Proceedings of the KDD '20: The 26th ACM SIGKDD Conference on Knowledge Discovery and Data Mining, 2020

Improving Generalization Performance of Adaptive Learning Rate by Switching from Block Diagonal Matrix Preconditioning to SGD.
Proceedings of the 2020 International Joint Conference on Neural Networks, 2020

Fast Deterministic CUR Matrix Decomposition with Accuracy Assurance.
Proceedings of the 37th International Conference on Machine Learning, 2020

Absum: Simple Regularization Method for Reducing Structural Sensitivity of Convolutional Neural Networks.
Proceedings of the Thirty-Fourth AAAI Conference on Artificial Intelligence, 2020

2019
Fast Sparse Group Lasso.
Proceedings of the Advances in Neural Information Processing Systems 32: Annual Conference on Neural Information Processing Systems 2019, 2019

Network Implosion: Effective Model Compression for ResNets via Static Layer Pruning and Retraining.
Proceedings of the International Joint Conference on Neural Networks, 2019

Fast Random Forest Algorithm via Incremental Upper Bound.
Proceedings of the 28th ACM International Conference on Information and Knowledge Management, 2019

Efficient Data Point Pruning for One-Class SVM.
Proceedings of the Thirty-Third AAAI Conference on Artificial Intelligence, 2019

2018
Adaptive Data Pruning for Support Vector Machines.
Proceedings of the IEEE International Conference on Big Data (IEEE BigData 2018), 2018

2017
Adaptive Learning Rate via Covariance Matrix Based Preconditioning for Deep Neural Networks.
Proceedings of the Twenty-Sixth International Joint Conference on Artificial Intelligence, 2017

2016
Fast Algorithm for the Lasso based L1-Graph Construction.
Proc. VLDB Endow., 2016

Controlling Exploration Improves Training for Deep Neural Networks.
CoRR, 2016

Fast Lasso Algorithm via Selective Coordinate Descent.
Proceedings of the Thirtieth AAAI Conference on Artificial Intelligence, 2016

2015
Adaptive Message Update for Fast Affinity Propagation.
Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, 2015

2013
Domain-dependent/independent topic switching model for online reviews with numerical ratings.
Proceedings of the 22nd ACM International Conference on Information and Knowledge Management, 2013

Label-Related/Unrelated Topic Switching Model: A Partially Labeled Topic Model Handling Infinite Label-Unrelated Topics.
Proceedings of the 2nd IAPR Asian Conference on Pattern Recognition, 2013

2012
Handling incomplete matrix data via continuous-valued infinite relational model.
Proceedings of the 2012 IEEE International Conference on Acoustics, 2012


  Loading...