default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXiangming Meng
Person information
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2025
[i24]Chunnan Shang, Zhizhong Wang, Hongwei Wang, Xiangming Meng:
SCSA: A Plug-and-Play Semantic Continuous-Sparse Attention for Arbitrary Semantic Style Transfer. CoRR abs/2503.04119 (2025)- 2024
- [c18]Xiangming Meng, Yoshiyuki Kabashima:
QCS-SGM+: Improved Quantized Compressed Sensing with Score-Based Generative Models. AAAI 2024: 14341-14349 - [c17]Xiangming Meng, Yoshiyuki Kabashima:
Diffusion Model Based Posterior Sampling for Noisy Linear Inverse Problems. ACML 2024: 623-638 - [c16]Shuting Tao, Tongtian Zhu, Hongwei Wang, Xiangming Meng:
SemanticMask: A Contrastive View Design for Anomaly Detection in Tabular Data. IJCAI 2024: 2370-2378 - [i23]Zhi Qi, Shihong Yuan, Yuyin Yuan, Linling Kuang, Yoshiyuki Kabashima, Xiangming Meng:
Improving Decoupled Posterior Sampling for Inverse Problems using Data Consistency Constraint. CoRR abs/2412.00664 (2024) - 2023
- [j13]Meng Cheng
, Xiangming Meng:
Decode-and-Forward vs. Lossy-Forward: Intelligent Reflecting Surface-Assisted Sidelink Transmission. IEEE Trans. Veh. Technol. 72(9): 12425-12429 (2023) - [c15]Xiangming Meng, Tomoyuki Obuchi, Yoshiyuki Kabashima:
On Model Selection Consistency of Lasso for High-Dimensional Ising Models. AISTATS 2023: 6783-6805 - [c14]Koki Okajima, Xiangming Meng, Takashi Takahashi, Yoshiyuki Kabashima:
Average case analysis of Lasso under ultra sparse conditions. AISTATS 2023: 11317-11330 - [c13]Jiang Zhu, Xiangming Meng, Xupeng Lei, Qinghua Guo:
A Unitary Transform Based Generalized Approximate Message Passing. ICASSP 2023: 1-5 - [c12]Xiangming Meng, Yoshiyuki Kabashima:
Quantized Compressed Sensing with Score-Based Generative Models. ICLR 2023 - [i22]Xiangming Meng, Yoshiyuki Kabashima:
QCM-SGM+: Improved Quantized Compressed Sensing With Score-Based Generative Models for General Sensing Matrices. CoRR abs/2302.00919 (2023) - [i21]Koki Okajima, Xiangming Meng, Takashi Takahashi, Yoshiyuki Kabashima:
Average case analysis of Lasso under ultra-sparse conditions. CoRR abs/2302.13093 (2023) - 2022
- [c11]Liu Ziyin, Botao Li, Xiangming Meng:
Exact Solutions of a Deep Linear Network. NeurIPS 2022 - [i20]Liu Ziyin, Hanlin Zhang, Xiangming Meng, Yuting Lu, Eric P. Xing, Masahito Ueda:
Stochastic Neural Networks with Infinite Width are Deterministic. CoRR abs/2201.12724 (2022) - [i19]Liu Ziyin, Botao Li, Xiangming Meng:
Exact Solutions of a Deep Linear Network. CoRR abs/2202.04777 (2022) - [i18]Jiang Zhu, Xiangming Meng, Xupeng Lei, Qinghua Guo:
A Unitary Transform Based Generalized Approximate Message Passing. CoRR abs/2210.08861 (2022) - [i17]Xiangming Meng, Yoshiyuki Kabashima:
Diffusion Model Based Posterior Sampling for Noisy Linear Inverse Problems. CoRR abs/2211.12343 (2022) - [i16]Xiangming Meng, Yoshiyuki Kabashima:
Quantized Compressed Sensing with Score-Based Generative Models. CoRR abs/2211.13006 (2022) - 2021
- [j12]Xiangming Meng, Lei Zhang, Chao Wang, Lei Wang, Yiqun Wu, Yan Chen, Wenjin Wang:
Advanced NOMA Receivers From a Unified Variational Inference Perspective. IEEE J. Sel. Areas Commun. 39(4): 934-948 (2021) - [j11]Man Luo, Qinghua Guo, Ming Jin, Yonina C. Eldar, Defeng Huang, Xiangming Meng:
Unitary Approximate Message Passing for Sparse Bayesian Learning. IEEE Trans. Signal Process. 69: 6023-6039 (2021) - [c10]Xiangming Meng, Tomoyuki Obuchi, Yoshiyuki Kabashima:
Ising Model Selection Using $\ell_{1}$-Regularized Linear Regression: A Statistical Mechanics Analysis. NeurIPS 2021: 6290-6303 - [i15]Xiangming Meng, Tomoyuki Obuchi, Yoshiyuki Kabashima:
Ising Model Selection Using 𝓁1-Regularized Linear Regression. CoRR abs/2102.03988 (2021) - [i14]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) - 2020
- [j10]Jiang Zhu, Qi Zhang, Xiangming Meng, Zhiwei Xu:
Vector approximate message passing algorithm for compressed sensing with structured matrix perturbation. Signal Process. 166 (2020) - [c9]Xiangming Meng, Roman Bachmann, Mohammad Emtiyaz Khan:
Training Binary Neural Networks using the Bayesian Learning Rule. ICML 2020: 6852-6861 - [i13]Xiangming Meng, Roman Bachmann, Mohammad Emtiyaz Khan:
Training Binary Neural Networks using the Bayesian Learning Rule. CoRR abs/2002.10778 (2020) - [i12]Xiangming Meng:
Training Restricted Boltzmann Machines with Binary Synapses using the Bayesian Learning Rule. CoRR abs/2007.04676 (2020) - [i11]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]Xiangming Meng, Jiang Zhu:
Bilinear Adaptive Generalized Vector Approximate Message Passing. IEEE Access 7: 4807-4815 (2019) - [j8]Jiang Zhu, Lin Han, Xiangming Meng:
An AMP-Based Low Complexity Generalized Sparse Bayesian Learning Algorithm. IEEE Access 7: 7965-7976 (2019) - [c8]Lei Zhang, Xiangming Meng, Lei Wang, Yan Chen:
Joint User Activity and Data Detection for NOMA via the Integrated Framework of Expectation Maximization and Expectation Propagation. SPAWC 2019: 1-5 - 2018
- [j7]Xiangming Meng, Jiang Zhu:
A Generalized Sparse Bayesian Learning Algorithm for 1-bit DOA Estimation. IEEE Commun. Lett. 22(7): 1414-1417 (2018) - [j6]Xiangming Meng, Sheng Wu, Jiang Zhu:
A Unified Bayesian Inference Framework for Generalized Linear Models. IEEE Signal Process. Lett. 25(3): 398-402 (2018) - [c7]Malong Ke, Zhen Gao, Yongpeng Wu, Xiangming Meng:
Compressive Massive Random Access for Massive Machine-Type Communications (mMTC). GlobalSIP 2018: 156-160 - [c6]Xiangming Meng, Yiqun Wu, Chao Wang, Yan Chen:
A Universal Receiver for Uplink NOMA Systems. ICCC Workshops 2018: 117-121 - [c5]Xiangming Meng, Yiqun Wu, Chao Wang, Yan Chen:
Turbo-Like Iterative Multi-User Receiver Design for 5G Non-Orthogonal Multiple Access. VTC Fall 2018: 1-5 - [i10]Jiang Zhu, Lin Han, Xiangming Meng, Zhiwei Xu:
Binary Sparse Bayesian Learning Algorithm for One-bit Compressed Sensing. CoRR abs/1805.03043 (2018) - [i9]Malong Ke, Zhen Gao, Yongpeng Wu, Xiangming Meng:
Compressive Massive Random Access for Massive Machine-Type Communications (mMTC). CoRR abs/1809.03784 (2018) - [i8]Xiangming Meng, Jiang Zhu:
Bilinear Adaptive Generalized Vector Approximate Message Passing. CoRR abs/1810.08129 (2018) - [i7]Jiang Zhu, Qi Zhang, Xiangming Meng:
Off-grid Variational Bayesian Inference of Line Spectral Estimation from One-bit Samples. CoRR abs/1811.05680 (2018) - [i6]Xiangming Meng, Yiqun Wu, Chao Wang, Yan Chen:
A Universal Receiver for Uplink NOMA Systems. CoRR abs/1812.04810 (2018) - [i5]Xiangming Meng, Yiqun Wu, Chao Wang, Yan Chen:
Turbo-like Iterative Multi-user Receiver Design for 5G Non-orthogonal Multiple Access. CoRR abs/1812.04812 (2018) - 2017
- [j5]Xincong Lin, Sheng Wu, Linling Kuang, Zuyao Ni, Xiangming Meng, Chunxiao Jiang:
Estimation of Sparse Massive MIMO-OFDM Channels With Approximately Common Support. IEEE Commun. Lett. 21(5): 1179-1182 (2017) - [j4]Kun Wu, Guangliang Ren, Xiangming Meng, Jueying Wu, Qiwei Wang:
Spectral-Efficient Band Allocation Scheme for Frequency-Domain Pulse-Shaping-Based SC-FDMA Systems. IEEE Trans. Veh. Technol. 66(9): 8249-8262 (2017) - [c4]Xiangming Meng, Yiqun Wu, Yan Chen, Meng Cheng:
Low Complexity Receiver for Uplink SCMA System via Expectation Propagation. WCNC 2017: 1-5 - [i4]Xiangming Meng, Yiqun Wu, Yan Chen, Meng Cheng:
Low Complexity Receiver for Uplink SCMA System via Expectation Propagation. CoRR abs/1701.01195 (2017) - [i3]Xiangming Meng, Sheng Wu, Jiang Zhu:
A Unified Bayesian Inference Framework for Generalized Linear Models. CoRR abs/1712.10288 (2017) - 2016
- [j3]Xiangming Meng, Sheng Wu, Linling Kuang, Defeng Huang, Jianhua Lu:
Multi-User Detection for Spatial Modulation via Structured Approximate Message Passing. IEEE Commun. Lett. 20(8): 1527-1530 (2016) - [j2]Sheng Wu, Zuyao Ni, Xiangming Meng, Linling Kuang:
Block Expectation Propagation for Downlink Channel Estimation in Massive MIMO Systems. IEEE Commun. Lett. 20(11): 2225-2228 (2016) - [i2]Xiangming Meng, Sheng Wu, Linling Kuang, Defeng Huang, Jianhua Lu:
Approximate Message Passing with Nearest Neighbor Sparsity Pattern Learning. CoRR abs/1601.00543 (2016) - 2015
- [j1]Xiangming Meng, Sheng Wu, Linling Kuang, Jianhua Lu:
An Expectation Propagation Perspective on Approximate Message Passing. IEEE Signal Process. Lett. 22(8): 1194-1197 (2015) - [c3]Xiangming Meng, Sheng Wu, Linling Kuang, Jianhua Lu:
Message Passing Approach to Regularized Zero-Forcing Precoding in Multibeam Satellite Systems. VTC Fall 2015: 1-5 - [c2]Xiangming Meng, Sheng Wu, Linling Kuang, Zuyao Ni, Jianhua Lu:
Novel Scheme of Orthogonal Convolutional Coding and Non-Iterative Decoding for Mobile Satellite Communication Systems. VTC Fall 2015: 1-5 - [i1]Xiangming Meng, Sheng Wu, Linling Kuang, Jianhua Lu:
Concise Derivation of Complex Bayesian Approximate Message Passing via Expectation Propagation. CoRR abs/1509.08658 (2015) - 2014
- [c1]Xiangming Meng, Sheng Wu, Linling Kuang, Zuyao Ni, Jianhua Lu:
Expectation Propagation Based Iterative Multi-User Detection for MIMO-IDMA Systems. VTC Spring 2014: 1-5
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 2025-04-11 18:32 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:
