default search action
Yoshiyuki Kabashima
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
- [c33]Xiangming Meng, Yoshiyuki Kabashima:
QCS-SGM+: Improved Quantized Compressed Sensing with Score-Based Generative Models. AAAI 2024: 14341-14349 - 2023
- [j14]Ayaka Sakata
, Yoshiyuki Kabashima
Decision Theoretic Cutoff and ROC Analysis for Bayesian Optimal Group Testing. IEEE Trans. Inf. Theory 69(9): 5902-5920 (2023) - [j13]Siqi Na
Compressed Sensing Radar Detectors Under the Row-Orthogonal Design Model: A Statistical Mechanics Perspective. IEEE Trans. Signal Process. 71: 2668-2682 (2023) - [c32]Xiangming Meng, Tomoyuki Obuchi, Yoshiyuki Kabashima:
On Model Selection Consistency of Lasso for High-Dimensional Ising Models. AISTATS 2023: 6783-6805 - [c31]Koki Okajima, Xiangming Meng, Takashi Takahashi, Yoshiyuki Kabashima:
Average case analysis of Lasso under ultra sparse conditions. AISTATS 2023: 11317-11330 - [c30]Xiangming Meng, Yoshiyuki Kabashima:
Quantized Compressed Sensing with Score-Based Generative Models. ICLR 2023 - [i62]Xiangming Meng, Yoshiyuki Kabashima:
QCM-SGM+: Improved Quantized Compressed Sensing With Score-Based Generative Models for General Sensing Matrices. CoRR abs/2302.00919 (2023) - [i61]Koki Okajima, Xiangming Meng, Takashi Takahashi, Yoshiyuki Kabashima:
Average case analysis of Lasso under ultra-sparse conditions. CoRR abs/2302.13093 (2023) - [i60]Makiko Konoshima, Hirotaka Tamura, Yoshiyuki Kabashima:
Generating gradients in the energy landscape using rectified linear type cost functions for efficiently solving 0/1 matrix factorization in Simulated Annealing. CoRR abs/2312.17272 (2023) - 2022
- [j12]Takashi Takahashi
Macroscopic Analysis of Vector Approximate Message Passing in a Model-Mismatched Setting. IEEE Trans. Inf. Theory 68(8): 5579-5600 (2022) - [i59]Xiangming Meng, Yoshiyuki Kabashima:
Diffusion Model Based Posterior Sampling for Noisy Linear Inverse Problems. CoRR abs/2211.12343 (2022) - [i58]Xiangming Meng, Yoshiyuki Kabashima:
Quantized Compressed Sensing with Score-Based Generative Models. CoRR abs/2211.13006 (2022) - 2021
- [c29]Xiangming Meng, Tomoyuki Obuchi, Yoshiyuki Kabashima:
Ising Model Selection Using $\ell_{1}$-Regularized Linear Regression: A Statistical Mechanics Analysis. NeurIPS 2021: 6290-6303 - [i57]Xiangming Meng, Tomoyuki Obuchi, Yoshiyuki Kabashima:
Ising Model Selection Using 𝓁1-Regularized Linear Regression. CoRR abs/2102.03988 (2021) - [i56]Koki Okajima, Yoshiyuki Kabashima:
Matrix completion based on Gaussian belief propagation. CoRR abs/2105.00233 (2021) - [i55]Xiangming Meng, Tomoyuki Obuchi, Yoshiyuki Kabashima:
On Model Selection Consistency of Lasso for High-Dimensional Ising Models on Tree-like Graphs. CoRR abs/2110.08500 (2021) - [i54]Ayaka Sakata, Yoshiyuki Kabashima:
Decision Theoretic Cutoff and ROC Analysis for Bayesian Optimal Group Testing. CoRR abs/2110.10877 (2021) - 2020
- [j11]Johan Pensar
High-dimensional structure learning of binary pairwise Markov networks: A comparative numerical study. Comput. Stat. Data Anal. 141: 62-76 (2020) - [j10]Yu Terada
Inferring Neuronal Couplings From Spiking Data Using a Systematic Procedure With a Statistical Criterion. Neural Comput. 32(11): 2187-2211 (2020) - [c28]Takashi Takahashi, Yoshiyuki Kabashima:
Macroscopic Analysis of Vector Approximate Message Passing in a Model Mismatch Setting. ISIT 2020: 1403-1408 - [i53]Takashi Takahashi, Yoshiyuki Kabashima:
Macroscopic Analysis of Vector Approximate Message Passing in a Model Mismatch Setting. CoRR abs/2001.02824 (2020) - [i52]Takashi Takahashi, Yoshiyuki Kabashima:
Semi-analytic approximate stability selection for correlated data in generalized linear models. CoRR abs/2003.08670 (2020) - [i51]Kao Hayashi, Tomoyuki Obuchi, Yoshiyuki Kabashima:
Perfect Reconstruction of Sparse Signals via Greedy Monte-Carlo Search. CoRR abs/2008.03175 (2020) - [i50]Xiangming Meng, Tomoyuki Obuchi, Yoshiyuki Kabashima:
Structure Learning in Inverse Ising Problems Using 𝓁2-Regularized Linear Estimator. CoRR abs/2008.08342 (2020)
2010 – 2019
- 2019
- [j9]Tomoyuki Obuchi, Yoshiyuki Kabashima:
Semi-Analytic Resampling in Lasso. J. Mach. Learn. Res. 20: 70:1-70:33 (2019) - [i49]Johan Pensar, Yingying Xu, Santeri Puranen, Maiju Pesonen, Yoshiyuki Kabashima, Jukka Corander:
High-dimensional structure learning of binary pairwise Markov networks: A comparative numerical study. CoRR abs/1901.04345 (2019) - [i48]Takashi Takahashi, Yoshiyuki Kabashima:
Replicated Vector Approximate Message Passing For Resampling Problem. CoRR abs/1905.09545 (2019) - [i47]Chihiro Noguchi, Yoshiyuki Kabashima:
Approximate matrix completion based on cavity method. CoRR abs/1907.00138 (2019) - [i46]Alia Abbara, Yoshiyuki Kabashima, Tomoyuki Obuchi, Yingying Xu:
Learning performance in inverse Ising problems with sparse teacher couplings. CoRR abs/1912.11591 (2019) - 2018
- [j8]Tomoyuki Obuchi, Yoshiyuki Kabashima:
Accelerating Cross-Validation in Multinomial Logistic Regression with $\ell_1$-Regularization. J. Mach. Learn. Res. 19: 52:1-52:30 (2018) - [c27]Yu Terada, Tomoyuki Obuchi, Takuya Isomura, Yoshiyuki Kabashima:
Objective and efficient inference for couplings in neuronal networks. NeurIPS 2018: 4976-4985 - [i45]Tomoyuki Obuchi, Yoshinori Nakanishi-Ohno, Masato Okada, Yoshiyuki Kabashima:
Statistical mechanical analysis of sparse linear regression as a variable selection problem. CoRR abs/1805.11259 (2018) - [i44]Tatsuro Kawamoto, Yoshiyuki Kabashima:
Counting the number of metastable states in the modularity landscape: Algorithmic detectability limit of greedy algorithms in community detection. CoRR abs/1808.07690 (2018) - 2016
- [j7]Mikko Vehkaperä
Analysis of Regularized LS Reconstruction and Random Matrix Ensembles in Compressed Sensing. IEEE Trans. Inf. Theory 62(4): 2100-2124 (2016) - [j6]Yoshiyuki Kabashima, Florent Krzakala
Phase Transitions and Sample Complexity in Bayes-Optimal Matrix Factorization. IEEE Trans. Inf. Theory 62(7): 4228-4265 (2016) - [c26]Yoshiyuki Kabashima, Tomoyuki Obuchi, Makoto Uemura
Approximate cross-validation formula for Bayesian linear regression. Allerton 2016: 596-600 - [c25]Tomoyuki Obuchi, Yoshiyuki Kabashima:
Sampling approach to sparse approximation problem: Determining degrees of freedom by simulated annealing. EUSIPCO 2016: 1247-1251 - [i43]Tomoyuki Obuchi, Yoshiyuki Kabashima:
Cross validation in LASSO and its acceleration. CoRR abs/1601.00881 (2016) - [i42]Tomoyuki Obuchi, Yoshiyuki Kabashima:
Sparse approximation problem: how rapid simulated annealing succeeds and fails. CoRR abs/1601.01074 (2016) - [i41]Tomoyuki Obuchi, Yoshiyuki Kabashima:
Sampling approach to sparse approximation problem: determining degrees of freedom by simulated annealing. CoRR abs/1603.01399 (2016) - [i40]Yingying Xu, Yoshiyuki Kabashima:
Statistical mechanics analysis of thresholding 1-bit compressed sensing. CoRR abs/1605.01867 (2016) - [i39]Tatsuro Kawamoto, Yoshiyuki Kabashima:
Cross-validation model assessment for modular networks. CoRR abs/1605.07915 (2016) - [i38]Tatsuro Kawamoto, Yoshiyuki Kabashima:
Comparative analysis of model assessment in community detection. CoRR abs/1606.07668 (2016) - [i37]Tatsuro Kawamoto, Yoshiyuki Kabashima:
Detectability thresholds of general modular graphs. CoRR abs/1608.08908 (2016) - [i36]Yoshiyuki Kabashima, Tomoyuki Obuchi, Makoto Uemura:
Approximate cross-validation formula for Bayesian linear regression. CoRR abs/1610.07733 (2016) - 2015
- [c24]Ayaka Sakata
Replica symmetric bound for restricted isometry constant. ISIT 2015: 2006-2010 - [i35]Ayaka Sakata, Yoshiyuki Kabashima:
Replica Symmetric Bound for Restricted Isometry Constant. CoRR abs/1501.06281 (2015) - [i34]Tatsuro Kawamoto, Yoshiyuki Kabashima:
Limitations in the spectral method for graph partitioning: detectability threshold and localization of eigenvectors. CoRR abs/1502.06775 (2015) - [i33]Paulo V. Rossi, Yoshiyuki Kabashima, Jun-ichi Inoue:
Online compressed sensing. CoRR abs/1509.05108 (2015) - [i32]Tatsuro Kawamoto, Yoshiyuki Kabashima:
Detectability of the spectral method for sparse graph partitioning. CoRR abs/1509.06484 (2015) - [i31]Yoshinori Nakanishi-Ohno, Tomoyuki Obuchi, Masato Okada, Yoshiyuki Kabashima:
Dimensionality reduction based on an overcomplete basis. CoRR abs/1510.02189 (2015) - 2014
- [c23]Yoshiyuki Kabashima, Mikko Vehkaperä
Signal recovery using expectation consistent approximation for linear observations. ISIT 2014: 226-230 - [c22]Mikko Vehkaperä
Analysis of regularized LS reconstruction and random matrix ensembles in compressed sensing. ISIT 2014: 3185-3189 - [i30]Yoshiyuki Kabashima, Mikko Vehkaperä:
Signal recovery using expectation consistent approximation for linear observations. CoRR abs/1401.5151 (2014) - [i29]Yoshiyuki Kabashima, Florent Krzakala, Marc Mézard, Ayaka Sakata, Lenka Zdeborová:
Phase transitions and sample complexity in Bayes-optimal matrix factorization. CoRR abs/1402.1298 (2014) - [i28]Yingying Xu, Yoshiyuki Kabashima, Lenka Zdeborová:
Bayesian signal reconstruction for 1-bit compressed sensing. CoRR abs/1406.3782 (2014) - [i27]Haiping Huang, Yoshiyuki Kabashima:
Origin of the computational hardness for learning with binary synapses. CoRR abs/1408.1784 (2014) - 2013
- [c21]Mikko Vehkaperä, Yoshiyuki Kabashima, Saikat Chatterjee:
Statistical mechanics approach to sparse noise denoising. EUSIPCO 2013: 1-5 - [c20]Ayaka Sakata
Sample complexity of Bayesian optimal dictionary learning. ISIT 2013: 669-673 - [i26]Yingying Xu, Yoshiyuki Kabashima:
Statistical mechanics approach to 1-bit compressed sensing. CoRR abs/1301.1423 (2013) - [i25]Ayaka Sakata, Yoshiyuki Kabashima:
Sample Complexity of Bayesian Optimal Dictionary Learning. CoRR abs/1301.6199 (2013) - [i24]Mikko Vehkaperä, Yoshiyuki Kabashima, Saikat Chatterjee:
Statistical Mechanics Approach to Sparse Noise Denoising. CoRR abs/1303.4266 (2013) - [i23]Haiping Huang, K. Y. Michael Wong, Yoshiyuki Kabashima:
Entropy landscape of solutions in the binary perceptron problem. CoRR abs/1304.2850 (2013) - [i22]Koujin Takeda, Yoshiyuki Kabashima:
Reconstruction algorithm in compressed sensing based on maximum a posteriori estimation. CoRR abs/1311.0095 (2013) - [i21]Mikko Vehkaperä, Yoshiyuki Kabashima, Saikat Chatterjee:
Analysis of Regularized LS Reconstruction and Random Matrix Ensembles in Compressed Sensing. CoRR abs/1312.0256 (2013) - 2012
- [c19]Maria Chiara Angelini
Compressed sensing with sparse, structured matrices. Allerton Conference 2012: 808-814 - [c18]Doohwan Lee, Yoshiyuki Kabashima, Koujin Takeda, Takayuki Yamada, Kazunori Akabane, Kazuhiro Uehara:
Sparse-matrix-based compressed sensing for spectrum sensing in Flexible Wireless System. APCC 2012: 418-422 - [c17]Koujin Takeda, Yoshiyuki Kabashima
A study of the universal threshold in the ℓ1 recovery by statistical mechanics. CISS 2012: 1-6 - [c16]Takuma Goto, Yoshiyuki Kabashima, Hiroya Takamura:
Statistical Mechanical Analysis of Semantic Orientations on Lexical Network. COLING 2012: 977-994 - [c15]Kazushi Mimura, Tadashi Wadayama, Yoshiyuki Kabashima:
Average growth rate of low-density generator-matrix codes ensembles. ISITA 2012: 322-326 - [c14]Mikko Vehkaperä
Analysis of sparse representations using bi-orthogonal dictionaries. ITW 2012: 647-651 - [i20]Ayaka Sakata, Yoshiyuki Kabashima:
Statistical Mechanics of Dictionary Learning. CoRR abs/1203.6178 (2012) - [i19]Koujin Takeda, Yoshiyuki Kabashima:
A study of the universal threshold in the L1 recovery by statistical mechanics. CoRR abs/1203.6246 (2012) - [i18]Mikko Vehkaperä, Yoshiyuki Kabashima, Saikat Chatterjee, Erik Aurell, Mikael Skoglund, Lars K. Rasmussen:
Analysis of Sparse Representations Using Bi-Orthogonal Dictionaries. CoRR abs/1204.4065 (2012) - [i17]Ayaka Sakata, Yoshiyuki Kabashima, Yitzhak Peleg:
A Mean-field Approach for an Intercarrier Interference Canceller for OFDM. CoRR abs/1205.3594 (2012) - [i16]Maria Chiara Angelini, Federico Ricci-Tersenghi, Yoshiyuki Kabashima:
Compressed sensing with sparse, structured matrices. CoRR abs/1207.2853 (2012) - [i15]Yoshiyuki Kabashima, Mikko Vehkaperä, Saikat Chatterjee:
Typical l1-recovery limit of sparse vectors represented by concatenations of random orthogonal matrices. CoRR abs/1208.4696 (2012) - 2011
- [j5]Tomonori Ando, Yoshiyuki Kabashima, Hisanao Takahashi, Osamu Watanabe, Masaki Yamamoto:
Spectral Analysis of Random Sparse Matrices. IEICE Trans. Fundam. Electron. Commun. Comput. Sci. 94-A(6): 1247-1256 (2011) - [c13]Kazushi Mimura, Tadashi Wadayama, Toshiyuki Tanaka, Yoshiyuki Kabashima:
Average error exponent of undetected error probability of binary matrix ensembles. ISIT 2011: 1387-1391 - [i14]Yoshiyuki Kabashima, Tadashi Wadayama:
A signal recovery algorithm for sparse matrix based compressed sensing. CoRR abs/1102.3220 (2011) - 2010
- [c12]Yoshiyuki Kabashima, Tadashi Wadayama, Toshiyuki Tanaka:
Statistical mechanical analysis of a typical reconstruction limit of compressed sensing. ISIT 2010: 1533-1537 - [c11]Koujin Takeda, Yoshiyuki Kabashima:
Statistical mechanical analysis of compressed sensing utilizing correlated compression matrix. ISIT 2010: 1538-1542 - [i13]Yoshiyuki Kabashima, Tadashi Wadayama, Toshiyuki Tanaka:
Statistical Mechanical Analysis of a Typical Reconstruction Limit of Compressed Sensing. CoRR abs/1001.4298 (2010) - [i12]Koujin Takeda, Yoshiyuki Kabashima:
Statistical Mechanical Analysis of Compressed Sensing Utilizing Correlated Compression Matrix. CoRR abs/1001.4361 (2010) - [i11]Koujin Takeda, Yoshiyuki Kabashima:
Statistical Mechanical Assessment of a Reconstruction Limit of Compressed Sensing: Toward Theoretical Analysis of Correlated Signals. CoRR abs/1008.5274 (2010)
2000 – 2009
- 2009
- [j4]Ken-ichi Tamura, Miho Komiya, Masato Inoue
Decoding Algorithm of Low-density Parity-check Codes based on Bowman-Levin Approximation. New Gener. Comput. 27(4): 347-363 (2009) - [i10]Yoshiyuki Kabashima, Tadashi Wadayama, Toshiyuki Tanaka:
Typical reconstruction limit of compressed sensing based on Lp-norm minimization. CoRR abs/0907.0914 (2009) - [i9]Atsushi Hatabu, Koujin Takeda, Yoshiyuki Kabashima:
Statistical mechanical analysis of the Kronecker channel model for MIMO wireless communication. CoRR abs/0909.3382 (2009) - 2008
- [c10]Yoshiyuki Kabashima:
An integral formula for large random rectangular matrices and its application to analysis of linear vector channels. WiOpt 2008: 620-624 - [i8]Yoshiyuki Kabashima:
An integral formula for large random rectangular matrices and its application to analysis of linear vector channels. CoRR abs/0802.1372 (2008) - [i7]Yoshiyuki Kabashima:
How could the replica method improve accuracy of performance assessment of channel coding? CoRR abs/0808.0548 (2008) - 2007
- [i6]Koujin Takeda, Atsushi Hatabu, Yoshiyuki Kabashima:
Statistical mechanical analysis of the linear vector channel in digital communication. CoRR abs/0707.3336 (2007) - [i5]Yoshiyuki Kabashima:
Inference from correlated patterns: a unified theory for perceptron learning and linear vector channels. CoRR abs/0708.3900 (2007) - 2006
- [j3]Yoshiyuki Kabashima:
Statistical Mechanics of Communication and Computation. New Gener. Comput. 24(4): 403-420 (2006) - [i4]Jonathan Paul Lewis Hatchett, Yoshiyuki Kabashima:
Survey propagation for the cascading Sourlas code. CoRR abs/cond-mat/0604267 (2006) - [i3]Koujin Takeda, Shinsuke Uda, Yoshiyuki Kabashima:
Analysis of CDMA systems that are characterized by eigenvalue spectrum. CoRR abs/cs/0607043 (2006) - 2005
- [c9]Masato Inoue, Miho Komiya, Yoshiyuki Kabashima:
An LDPCC decoding algorithm based on bowman-levin approximation -comparison with bp and CCCP-. ISIT 2005: 444-448 - [i2]Yoshiyuki Kabashima:
A CDMA multiuser detection algorithm based on survey propagation. CoRR abs/cs/0506062 (2005) - [i1]Tadaaki Hosaka, Yoshiyuki Kabashima:
Statistical Mechanical Approach to Lossy Data Compression:Theory and Practice. CoRR abs/cs/0509086 (2005) - 2004
- [c8]Yoshiyuki Kabashima, Shinsuke Uda:
A BP-Based Algorithm for Performing Bayesian Inference in Large Perceptron-Type Networks. ALT 2004: 479-493 - [c7]Tadaaki Hosaka, Yoshiyuki Kabashima:
Statistical mechanical evaluation of error exponents for lossy data compression. ISIT 2004: 479 - 2001
- [c6]Jort van Mourik, David Saad, Yoshiyuki Kabashima:
Weight vs. Magnetization Enumerator for Gallager Codes. IMACC 2001: 148-157 - [c5]David Saad
Statistical Physics of Low Density Parity Check Error Correcting Codes. IMACC 2001: 307-316 - 2000
- [c4]Renato Vicente, David Saad, Yoshiyuki Kabashima:
Error-correcting Codes on a Bethe-like Lattice. NIPS 2000: 322-328
1990 – 1999
- 1999
- [c3]Yoshiyuki Kabashima, Tatsuto Murayama, David Saad, Renato Vicente:
Regular and Irregular Gallager-zype Error-Correcting Codes. NIPS 1999: 272-278 - 1998
- [c2]Yoshiyuki Kabashima, David Saad:
The Belief in TAP. NIPS 1998: 246-252 - 1995
- [j2]Yoshiyuki Kabashima, Shigeru Shinomoto:
Learning a Decision Boundary from Stochastic Examples: Incremental Algorithms with and without Queries. Neural Comput. 7(1): 158-172 (1995) - 1993
- [c1]Yoshiyuki Kabashima, Shigeru Shinomoto:
Acceleration of Learning in Binary Choice Problems. COLT 1993: 446-452 - 1992
- [j1]Yoshiyuki Kabashima, Shigeru Shinomoto:
Learning Curves for Error Minimum and Maximum Likelihood Algorithms. Neural Comput. 4(5): 712-719 (1992)
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-09-13 00:38 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: