Seuraa
Naoki Marumo
Naoki Marumo
University of Tokyo, NTT
Vahvistettu sähköpostiosoite verkkotunnuksessa mist.i.u-tokyo.ac.jp - Kotisivu
Nimike
Viittaukset
Viittaukset
Vuosi
Majorization-minimization-based Levenberg–Marquardt method for constrained nonlinear least squares
N Marumo, T Okuno, A Takeda
Computational Optimization and Applications 84 (3), 833-874, 2023
25*2023
Continuous relaxation for discrete DC programming
T Maehara, N Marumo, K Murota
Mathematical Programming 169, 199-219, 2018
132018
Perfect discrimination of nonorthogonal quantum states with posterior classical partial information
S Akibue, G Kato, N Marumo
Physical Review A 99 (2), 020102, 2019
82019
Online Matching with Controllable Rewards and Arrival Probabilities.
Y Hikima, Y Akagi, N Marumo, H Kim
IJCAI, 1825-1833, 2022
72022
Continuous relaxation for discrete DC programming
T Maehara, N Marumo, K Murota
Modelling, Computation and Optimization in Information Systems and …, 2015
72015
Parameter-free accelerated gradient descent for nonconvex minimization
N Marumo, A Takeda
SIAM Journal on Optimization 34 (2), 2093-2120, 2024
62024
Scaling locally linear embedding
Y Fujiwara, N Marumo, M Blondel, K Takeuchi, H Kim, T Iwata, N Ueda
Proceedings of the 2017 ACM International Conference on Management of Data …, 2017
62017
A projected gradient method for opinion optimization with limited changes of susceptibility to persuasion
N Marumo, A Miyauchi, A Takeda, A Tanaka
Proceedings of the 30th ACM International Conference on Information …, 2021
42021
Properties of powers of functions satisfying second-order linear differential equations with applications to statistics
N Marumo, T Oaku, A Takemura
Japan Journal of Industrial and Applied Mathematics 32, 553-572, 2015
42015
Accelerated-gradient-based generalized Levenberg–Marquardt method with oracle complexity bound and local quadratic convergence
N Marumo, T Okuno, A Takeda
Mathematical Programming, 1-52, 2024
32024
Universal heavy-ball method for nonconvex optimization under Hölder continuous Hessians
N Marumo, A Takeda
Mathematical Programming, 1-29, 2024
32024
Analytically tractable models for decision making under present bias
Y Akagi, N Marumo, T Kurashima
Proceedings of the AAAI Conference on Artificial Intelligence 38 (9), 9441-9450, 2024
32024
Faster computation of nonstabilizerness
H Hamaguchi, K Hamada, N Marumo, N Yoshioka
arXiv preprint arXiv:2406.16673, 2024
22024
Modelling the discretization error of initial value problems using the Wishart distribution
N Marumo, T Matsuda, Y Miyatake
Applied Mathematics Letters 147, 108833, 2024
22024
Best-first search algorithm for non-convex sparse minimization
S Sakaue, N Marumo
arXiv preprint arXiv:1910.01296, 2019
22019
Optimal transport with cyclic symmetry
S Takeda, Y Akagi, N Marumo, K Niwa
Proceedings of the AAAI Conference on Artificial Intelligence 38 (14), 15211 …, 2024
12024
Non-approximate inference for collective graphical models on path graphs via discrete difference of convex algorithm
Y Akagi, N Marumo, H Kim, T Kurashima, H Toda
Advances in Neural Information Processing Systems 34, 25812-25823, 2021
12021
Calculation apparatus, calculation method and program
N Marumo, T Iwata
US Patent App. 17/050,760, 2021
12021
Co-occurrence estimation from aggregated data with auxiliary information
T Iwata, N Marumo
Proceedings of the AAAI Conference on Artificial Intelligence 34 (04), 4247-4254, 2020
12020
SVD-Based Screening for the Graphical Lasso.
Y Fujiwara, N Marumo, M Blondel, K Takeuchi, H Kim, T Iwata, N Ueda
IJCAI, 1682-1688, 2017
12017
Järjestelmä ei voi suorittaa toimenpidettä nyt. Yritä myöhemmin uudelleen.
Artikkelit 1–20