default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJun Sakuma
- > Home > Persons > Jun Sakuma
Publications
- 2024
[j19]Daiki Morinaga
, Kazuto Fukuchi, Jun Sakuma, Youhei Akimoto:
Convergence Rate of the (1+1)-ES on Locally Strongly Convex and Lipschitz Smooth Functions. IEEE Trans. Evol. Comput. 28(2): 501-515 (2024)- [c92]Daiki Morinaga, Kazuto Fukuchi, Jun Sakuma, Youhei Akimoto:
Linear Convergence Rate Analysis of the (1+1)-ES on Locally Strongly Convex and Lipschitz Smooth Functions. GECCO Companion 2024: 49-50 - [i40]Yu Zhe, Rei Nagaike, Daiki Nishiyama, Kazuto Fukuchi, Jun Sakuma:
Adversarial Attacks on Hidden Tasks in Multi-Task Learning. CoRR abs/2405.15244 (2024) - [i39]Mitsuhiro Fujikawa, Yohei Akimoto, Jun Sakuma, Kazuto Fukuchi:
Harnessing the Power of Vicinity-Informed Analysis for Classification under Covariate Shift. CoRR abs/2405.16906 (2024) - [i38]Shojiro Yamabe, Kazuto Fukuchi, Ryoma Senda, Jun Sakuma:
Behavior-Targeted Attack on Reinforcement Learning with Limited Access to Victim's Policy. CoRR abs/2406.03862 (2024) - 2023
- [j18]Atsuhiro Miyagi, Kazuto Fukuchi, Jun Sakuma, Youhei Akimoto:
Adaptive scenario subset selection for worst-case optimization and its application to well placement optimization. Appl. Soft Comput. 133: 109842 (2023) - [j17]Daiki Nishiyama, Kazuto Fukuchi, Youhei Akimoto, Jun Sakuma:
CAMRI Loss: Improving the Recall of a Specific Class without Sacrificing Accuracy. IEICE Trans. Inf. Syst. 106(4): 523-537 (2023) - [j16]Jiayang Liu, Weiming Zhang, Kazuto Fukuchi, Youhei Akimoto, Jun Sakuma:
Unauthorized AI cannot recognize me: Reversible adversarial example. Pattern Recognit. 134: 109048 (2023) - [j15]Atsuhiro Miyagi, Yoshiki Miyauchi, Atsuo Maki, Kazuto Fukuchi, Jun Sakuma, Youhei Akimoto:
Covariance Matrix Adaptation Evolutionary Strategy with Worst-Case Ranking Approximation for Min-Max Optimization and Its Application to Berthing Control Tasks. ACM Trans. Evol. Learn. Optim. 3(2): 8:1-8:32 (2023) - [j14]Thien Q. Tran, Kazuto Fukuchi, Youhei Akimoto, Jun Sakuma:
Statistically Significant Pattern Mining With Ordinal Utility. IEEE Trans. Knowl. Data Eng. 35(9): 8770-8783 (2023) - [c89]Yoshimasa Akimoto, Kazuto Fukuchi, Youhei Akimoto, Jun Sakuma:
Privformer: Privacy-preserving Transformer with MPC. EuroS&P 2023: 392-410 - [c88]Kaiwen Xu, Kazuto Fukuchi, Youhei Akimoto, Jun Sakuma:
Statistically Significant Concept-based Explanation of Image Classifiers via Model Knockoffs. IJCAI 2023: 519-526 - [c86]Kazuto Fukuchi, Jun Sakuma:
Demographic Parity Constrained Minimax Optimal Regression under Linear Model. NeurIPS 2023 - [c85]Kazuya Kakizaki, Kazuto Fukuchi, Jun Sakuma:
Certified Defense for Content Based Image Retrieval. WACV 2023: 4550-4559 - [i35]Rei Sato, Kazuto Fukuchi, Jun Sakuma, Youhei Akimoto:
Few-Shot Image-to-Semantics Translation for Policy Transfer in Reinforcement Learning. CoRR abs/2301.13343 (2023) - [i34]Atsuhiro Miyagi, Yoshiki Miyauchi, Atsuo Maki, Kazuto Fukuchi, Jun Sakuma, Youhei Akimoto:
Covariance Matrix Adaptation Evolutionary Strategy with Worst-Case Ranking Approximation for Min-Max Optimization and its Application to Berthing Control Tasks. CoRR abs/2303.16079 (2023) - [i31]Kaiwen Xu, Kazuto Fukuchi, Youhei Akimoto, Jun Sakuma:
Statistically Significant Concept-based Explanation of Image Classifiers via Model Knockoffs. CoRR abs/2305.18362 (2023) - 2022
- [j13]Yu Zhe, Kazuto Fukuchi, Youhei Akimoto, Jun Sakuma:
Domain Generalization via Adversarially Learned Novel Domains. IEEE Access 10: 101855-101868 (2022) - [j12]Naoki Sakamoto, Rei Sato, Kazuto Fukuchi, Jun Sakuma, Youhei Akimoto:
Explicitly Constrained Black-Box Optimization With Disconnected Feasible Domains Using Deep Generative Models. IEEE Access 10: 117501-117514 (2022) - [j11]Kazuto Fukuchi, Chia-Mu Yu, Jun Sakuma:
Locally Differentially Private Minimum Finding. IEICE Trans. Inf. Syst. 105-D(8): 1418-1430 (2022) - [c84]Thien Q. Tran, Kazuto Fukuchi, Youhei Akimoto, Jun Sakuma:
Unsupervised Causal Binary Concepts Discovery with VAE for Black-Box Model Explanation. AAAI 2022: 9614-9622 - [c83]Atsuhiro Miyagi, Kazuto Fukuchi, Jun Sakuma, Youhei Akimoto:
Black-box min-max continuous optimization using CMA-ES with worst-case ranking approximation. GECCO 2022: 823-831 - [c82]Yu Zhe, Kazuto Fukuchi, Youhei Akimoto, Jun Sakuma:
Domain Generalization Via Adversarially Learned Novel Domains. ICME 2022: 1-6 - [c81]Syou Hirofumi, Kazuto Fukuchi, Youhei Akimoto, Jun Sakuma:
Did You Use My GAN to Generate Fake? Post-hoc Attribution of GAN Generated Images via Latent Recovery. IJCNN 2022: 1-8 - [c80]Daiki Nishiyama, Kazuto Fukuchi, Youhei Akimoto, Jun Sakuma:
CAMRI Loss: Improving Recall of a Specific Class without Sacrificing Accuracy. IJCNN 2022: 1-8 - [c79]Rei Sato, Kazuto Fukuchi, Jun Sakuma, Youhei Akimoto:
Few-Shot Image-to-Semantics Translation for Policy Transfer in Reinforcement Learning. IJCNN 2022: 1-10 - [c77]Takumi Tanabe, Rei Sato, Kazuto Fukuchi, Jun Sakuma, Youhei Akimoto:
Max-Min Off-Policy Actor-Critic Method Focusing on Worst-Case Robustness to Model Misspecification. NeurIPS 2022 - [i28]Atsuhiro Miyagi, Kazuto Fukuchi, Jun Sakuma, Youhei Akimoto:
Black-Box Min-Max Continuous Optimization Using CMA-ES with Worst-case Ranking Approximation. CoRR abs/2204.02646 (2022) - [i27]Daiki Nishiyama, Kazuto Fukuchi, Youhei Akimoto, Jun Sakuma:
CAMRI Loss: Improving Recall of a Specific Class without Sacrificing Accuracy. CoRR abs/2209.10920 (2022) - [i26]Daiki Morinaga, Kazuto Fukuchi, Jun Sakuma, Youhei Akimoto:
Convergence rate of the (1+1)-evolution strategy on locally strongly convex functions with lipschitz continuous gradient and their monotonic transformations. CoRR abs/2209.12467 (2022) - [i25]Takumi Tanabe, Rei Sato, Kazuto Fukuchi, Jun Sakuma, Youhei Akimoto:
Max-Min Off-Policy Actor-Critic Method Focusing on Worst-Case Robustness to Model Misspecification. CoRR abs/2211.03413 (2022) - [i24]Atsuhiro Miyagi, Kazuto Fukuchi, Jun Sakuma, Youhei Akimoto:
Adaptive Scenario Subset Selection for Worst-Case Optimization and its Application to Well Placement Optimization. CoRR abs/2211.16574 (2022) - 2021
- [c74]Atsuhiro Miyagi, Kazuto Fukuchi, Jun Sakuma, Youhei Akimoto:
Adaptive scenario subset selection for min-max black-box continuous optimization. GECCO 2021: 697-705 - [c73]Takumi Tanabe, Kazuto Fukuchi, Jun Sakuma, Youhei Akimoto:
Level generation for angry birds with sequential VAE and latent variable evolution. GECCO 2021: 1052-1060 - [c72]Daiki Morinaga, Kazuto Fukuchi, Jun Sakuma, Youhei Akimoto:
Convergence rate of the (1+1)-evolution strategy with success-based step-size adaptation on convex quadratic functions. GECCO 2021: 1169-1177 - [i23]Daiki Morinaga, Kazuto Fukuchi, Jun Sakuma, Youhei Akimoto:
Convergence Rate of the (1+1)-Evolution Strategy with Success-Based Step-Size Adaptation on Convex Quadratic Functions. CoRR abs/2103.01578 (2021) - [i22]Takumi Tanabe, Kazuto Fukuchi, Jun Sakuma, Youhei Akimoto:
Level Generation for Angry Birds with Sequential VAE and Latent Variable Evolution. CoRR abs/2104.06106 (2021) - [i20]Thien Q. Tran, Kazuto Fukuchi, Youhei Akimoto, Jun Sakuma:
Unsupervised Causal Binary Concepts Discovery with VAE for Black-box Model Explanation. CoRR abs/2109.04518 (2021) - 2020
- [c70]Naoki Sakamoto, Eiji Semmatsu, Kazuto Fukuchi, Jun Sakuma, Youhei Akimoto:
Deep generative model for non-convex constraint handling. GECCO 2020: 636-644 - [c69]Thien Q. Tran, Kazuto Fukuchi, Youhei Akimoto, Jun Sakuma:
Statistically Significant Pattern Mining with Ordinal Utility. KDD 2020: 1645-1655 - [i18]Thien Q. Tran, Kazuto Fukuchi, Youhei Akimoto, Jun Sakuma:
Statistically Significant Pattern Mining with Ordinal Utility. CoRR abs/2008.10747 (2020) - 2019
- [i15]Kazuto Fukuchi, Chia-Mu Yu, Arashi Haishima, Jun Sakuma:
Locally Differentially Private Minimum Finding. CoRR abs/1905.11067 (2019) - 2018
- [c60]Kazuto Fukuchi, Jun Sakuma:
Minimax Optimal Additive Functional Estimation with Discrete Distribution: Slow Divergence Speed Case. ISIT 2018: 1041-1045 - [i13]Kazuto Fukuchi, Jun Sakuma:
Minimax Optimal Additive Functional Estimation with Discrete Distribution: Slow Divergence Speed Case. CoRR abs/1801.05362 (2018) - [i10]Kazuto Fukuchi, Jun Sakuma:
Minimax Optimal Additive Functional Estimation with Discrete Distribution. CoRR abs/1812.00001 (2018) - 2017
- [c54]Kazuto Fukuchi, Quang Khai Tran, Jun Sakuma:
Differentially Private Empirical Risk Minimization with Input Perturbation. DS 2017: 82-90 - [c53]Kazuya Kakizaki, Kazuto Fukuchi, Jun Sakuma:
Differentially Private Chi-squared Test by Unit Circle Mechanism. ICML 2017: 1761-1770 - [c52]Kazuto Fukuchi, Jun Sakuma:
Minimax optimal estimators for additive scalar functionals of discrete distributions. ISIT 2017: 2103-2107 - [i8]Kazuto Fukuchi, Jun Sakuma:
Minimax Optimal Estimators for Additive Scalar Functionals of Discrete Distributions. CoRR abs/1701.06381 (2017) - [i6]Kazuto Fukuchi, Quang Khai Tran, Jun Sakuma:
Differentially Private Empirical Risk Minimization with Input Perturbation. CoRR abs/1710.07425 (2017) - 2015
- [j4]Kazuto Fukuchi, Toshihiro Kamishima, Jun Sakuma:
Prediction with Model-Based Neutrality. IEICE Trans. Inf. Syst. 98-D(8): 1503-1516 (2015) - [c45]Rina Okada, Kazuto Fukuchi, Jun Sakuma:
Differentially Private Analysis of Outliers. ECML/PKDD (2) 2015: 458-473 - [i2]Kazuto Fukuchi, Jun Sakuma:
Fairness-Aware Learning with Restriction of Universal Dependency using f-Divergences. CoRR abs/1506.07721 (2015) - [i1]Rina Okada, Kazuto Fukuchi, Kazuya Kakizaki, Jun Sakuma:
Differentially Private Analysis of Outliers. CoRR abs/1507.06763 (2015) - 2014
- [c39]Kazuto Fukuchi, Jun Sakuma:
Neutralized Empirical Risk Minimization with Generalization Neutrality Bound. ECML/PKDD (1) 2014: 418-433 - 2013
- [c32]Kazuto Fukuchi, Jun Sakuma, Toshihiro Kamishima:
Prediction with Model-Based Neutrality. ECML/PKDD (2) 2013: 499-514
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-09-21 02:37 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:
