default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDSatoshi Hayakawa
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j4]Satoshi Hayakawa, Tetsuro Morimura:
Policy Gradient with Kernel Quadrature. Trans. Mach. Learn. Res. 2024 (2024)- [c11]Masaki Adachi
, Satoshi Hayakawa, Martin Jørgensen, Xingchen Wan, Vu Nguyen, Harald Oberhauser, Michael A. Osborne:
Adaptive Batch Sizes for Active Learning: A Probabilistic Numerics Approach. AISTATS 2024: 496-504 - [i13]Masaki Adachi, Satoshi Hayakawa, Martin Jørgensen, Saad Hamid, Harald Oberhauser, Michael A. Osborne:
A Quadrature Approach for General-Purpose Batch Bayesian Optimization via Probabilistic Lifting. CoRR abs/2404.12219 (2024) - 2023
- [j3]Satoshi Hayakawa, Takuya Nakagawa, Kazuma Hasegawa, Hidetoshi Oya, Yoshikatsu Hoshi:
Synthesis of adaptive gain robust model-following/tracking controllers for uncertain systems with multiple unknown dead-zone inputs via piecewise Lyapunov functions. Int. J. Syst. Sci. 54(8): 1790-1802 (2023) - [c10]Satoshi Hayakawa, Harald Oberhauser, Terry J. Lyons:
Sampling-based Nyström Approximation and Kernel Quadrature. ICML 2023: 12678-12699 - [c9]Hayata Yamasaki, Sathyawageeswar Subramanian, Satoshi Hayakawa, Sho Sonoda:
Quantum Ridgelet Transform: Winning Lottery Ticket of Neural Networks with Quantum Computation. ICML 2023: 39008-39034 - [i12]Satoshi Hayakawa, Harald Oberhauser, Terry J. Lyons:
Sampling-based Nyström Approximation and Kernel Quadrature. CoRR abs/2301.09517 (2023) - [i11]Masaki Adachi, Satoshi Hayakawa, Saad Hamid, Martin Jørgensen, Harald Oberhauser, Michael A. Osborne:
SOBER: Scalable Batch Bayesian Optimization and Quadrature using Recombination Constraints. CoRR abs/2301.11832 (2023) - [i10]Hayata Yamasaki, Sathyawageeswar Subramanian, Satoshi Hayakawa, Sho Sonoda:
Quantum Ridgelet Transform: Winning Lottery Ticket of Neural Networks with Quantum Computation. CoRR abs/2301.11936 (2023) - [i9]Masaki Adachi, Satoshi Hayakawa, Xingchen Wan, Martin Jørgensen, Harald Oberhauser, Michael A. Osborne:
Domain-Agnostic Batch Bayesian Optimization with Diverse Constraints via Bayesian Quadrature. CoRR abs/2306.05843 (2023) - [i8]Satoshi Hayakawa, Tetsuro Morimura:
Policy Gradient with Kernel Quadrature. CoRR abs/2310.14768 (2023) - 2022
- [c8]Satoshi Hayakawa, Takuya Nakagawa, Hidetoshi Oya, Yoshikatsu Hoshi:
Synthesis of Adaptive Gain Robust Controllers for Polytopic Uncertain Systems with Multiple Unknown Dead-Zone Inputs. IECON 2022: 1-6 - [c7]Masaki Adachi, Satoshi Hayakawa, Martin Jørgensen, Harald Oberhauser, Michael A. Osborne:
Fast Bayesian Inference with Batch Bayesian Quadrature via Kernel Recombination. NeurIPS 2022 - [c6]Satoshi Hayakawa, Harald Oberhauser, Terry J. Lyons:
Positively Weighted Kernel Quadrature via Subsampling. NeurIPS 2022 - [i7]Masaki Adachi, Satoshi Hayakawa, Martin Jørgensen, Harald Oberhauser, Michael A. Osborne:
Fast Bayesian Inference with Batch Bayesian Quadrature via Kernel Recombination. CoRR abs/2206.04734 (2022) - [i6]Satoshi Hayakawa, Harald Oberhauser, Terry J. Lyons:
Hypercontractivity Meets Random Convex Hulls: Analysis of Randomized Multivariate Cubatures. CoRR abs/2210.05787 (2022) - 2021
- [i5]Satoshi Hayakawa, Harald Oberhauser, Terry J. Lyons:
Positively Weighted Kernel Quadrature via Subsampling. CoRR abs/2107.09597 (2021) - 2020
- [j2]Satoshi Hayakawa, Ken'ichiro Tanaka:
Error bounds of potential theoretic numerical integration formulas in weighted Hardy spaces. JSIAM Lett. 12: 21-24 (2020) - [j1]Satoshi Hayakawa, Taiji Suzuki:
On the minimax optimality and superiority of deep neural network learning over sparse parameter spaces. Neural Networks 123: 343-361 (2020) - [i4]Satoshi Hayakawa:
Monte-Carlo Cubature construction. CoRR abs/2001.00843 (2020) - [i3]Satoshi Hayakawa, Ken'ichiro Tanaka:
Monte Carlo construction of cubature on Wiener space. CoRR abs/2008.08219 (2020)
2010 – 2019
- 2019
- [i2]Satoshi Hayakawa, Taiji Suzuki:
On the minimax optimality and superiority of deep neural network learning over sparse parameter spaces. CoRR abs/1905.09195 (2019) - [i1]Satoshi Hayakawa, Ken'ichiro Tanaka:
Convergence analysis of approximation formulas for analytic functions via duality for potential energy minimization. CoRR abs/1906.03133 (2019) - 2016
- [c5]Takanobu Mizuta, Yoshito Noritake, Satoshi Hayakawa, Kiyoshi Izumi:
Affecting market efficiency by increasing speed of order matching systems on financial exchanges - investigation using agent based model. SSCI 2016: 1-8 - 2013
- [c4]Yuki Shirosaki, Kohei Okamoto, Satoshi Hayakawa, Akiyoshi Osaka:
In vitro cytocompatibility of microspheres derived from chitosan-silicate hybrids. MHS 2013: 1-2
2000 – 2009
- 2007
- [c3]Sadaaki Miyamoto, Satoshi Hayakawa, Yuichi Kawasaki:
Term Clustering in Texts Based on Fuzzy Neighborhoods and Kernel Functions. KES (2) 2007: 517-524 - 2006
- [c2]Sadaaki Miyamoto, Satoshi Hayakawa:
A Fuzzy Neighborhood Model for Clustering, Classification, and Approximations. RSCTC 2006: 882-890 - 2005
- [c1]Sadaaki Miyamoto, Yasunori Endo, Satoshi Hayakawa, Erina Kataoka:
Classification and clustering of information objects based on fuzzy neighborhood system. SMC 2005: 3210-3215
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 21:19 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:
