Jingmin Wang

dblp:49/4329 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
2since 2021 · last 2025
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 3 · 2 first-author · 1 since 2021Security and privacy · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
2 papers
Reinforcement learning · 29% Planning, search and constraint satisfaction · 29% Speech recognition and synthesis · 29%
Network and information security
1 paper
Security and privacy of machine learning · 100%

Topics — the 8 heaviest of 8, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Natural language and speech › Speech recognition and synthesis › automatic speech recognition
adversarial attack on ASR
0.912025
APFT: Adaptive Phoneme Filter Template to Generate Anti-Compression Speech Adversarial Example in Real-Time · IEEE Trans. Inf. Forensics Secur. 2025
Natural language and speech › Speech recognition and synthesis
automatic speech recognition
0.912025
APFT: Adaptive Phoneme Filter Template to Generate Anti-Compression Speech Adversarial Example in Real-Time · IEEE Trans. Inf. Forensics Secur. 2025
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › planning under uncertainty
bayesian planning
0.912025
Reflect-then-Plan: Offline Model-Based Planning through a Doubly Bayesian Lens · ICML 2025
Machine learning › Reinforcement learning › model-based reinforcement learning
model-based planning
0.912025
Reflect-then-Plan: Offline Model-Based Planning through a Doubly Bayesian Lens · ICML 2025
Machine learning › Reinforcement learning
offline reinforcement learning
0.912025
Reflect-then-Plan: Offline Model-Based Planning through a Doubly Bayesian Lens · ICML 2025
Knowledge, reasoning and agents › Planning, search and constraint satisfaction
planning under uncertainty
0.912025
Reflect-then-Plan: Offline Model-Based Planning through a Doubly Bayesian Lens · ICML 2025
Machine learning › Probabilistic and Bayesian machine learning › statistical inference › bayesian inference
posterior inference
0.912025
Reflect-then-Plan: Offline Model-Based Planning through a Doubly Bayesian Lens · ICML 2025
Security and privacy of machine learning
adversarial example
0.912025
APFT: Adaptive Phoneme Filter Template to Generate Anti-Compression Speech Adversarial Example in Real-Time · IEEE Trans. Inf. Forensics Secur. 2025

Methods — techniques the papers use, named apart from their topics

phoneme filter template · 1.7adaptive band filtering · 1.7marginalization · 0.9doubly bayesian inference · 0.9belief updating · 0.9
YearPublicationVenuePosition
2025 Reflect-then-Plan: Offline Model-Based Planning through a Doubly Bayesian Lens
abstract
Offline reinforcement learning (RL) is crucial when online exploration is costly or unsafe but often struggles with high epistemic uncertainty due to limited data. Existing methods rely on fixed conservative policies, restricting adaptivity and generalization. To address this, we propose Reflect-then-Plan (RefPlan), a novel _doubly Bayesian_ offline model-based (MB) planning approach. RefPlan unifies uncertainty modeling and MB planning by recasting planning as Bayesian posterior estimation. At deployment, it updates a belief over environment dynamics using real-time observations, incorporating uncertainty into MB planning via marginalization. Empirical results on standard benchmarks show that RefPlan significantly improves the performance of conservative offline RL policies. In particular, RefPlan maintains robust performance under high epistemic uncertainty and limited data, while demonstrating resilience to changing environment dynamics, improving the flexibility, generalizability, and robustness of offline-learned policies.
Jihwan Jeong, Xiaoyu Wang 0018, Jingmin Wang, Scott Sanner, Pascal Poupart
ICML3
2025 APFT: Adaptive Phoneme Filter Template to Generate Anti-Compression Speech Adversarial Example in Real-Time
abstract
Automatic Speech Recognition (ASR) systems are widely used for speech censoring. Speech Adversarial Example (AE) offers a novel approach to protect speech privacy by forcing ASR to mistranscribe. However, existing speech AE faces two challenges in real-time voice communication scenarios, such as IP telephone, voice chat, or video conference, it cannot be generated in real-time, and its defensive capability is significantly reduced after the essential audio compression for network transmission. In this paper, we proposeAdaptive Phoneme Filter Template (APFT)to address these issues. The key features of APFT include: 1)Phoneme-level Templatesfor universal AE generation in real-time, 2)Filter, which eliminates redundant signals to improve compression robustness. 3)Adaptive Band Filtering, which limits the attack area from the frequency band without affecting the attack effectiveness and improves speech quality. The comprehensive experimental results show that APFT has four advantages: 1) Real-time Generation, with AE generation time below 1.1ms for 1s speech; 2) Compression Robustness, achieving a WER of 0.64 under AAC and Opus codecs; 3) Transferability, with an average WER of 0.72 across datasets and ASR systems; 4) Stealthiness, achieving a MOS of 4.07 for high-quality speech. In addition, the experiment on Telegram voice calls further proves the practical applicability of APFT. The demo of APFT can be obtained in https://yihuan-qaq.github.io/APFT.github.io/.
Yihuan Huang, Yanzhen Ren, Zongkun Sun, Liming Zhai, Jingmin Wang, Wuyang Liu
IEEE Trans. Inf. Forensics Secur.5
2006 A Improved SVM and Its Using in Electric Power System Load Forecasting
Jingmin Wang, Guoqiao Ren
ICONIP (1)1
2006 Study of the SMO Algorithm Applied in Power System Load Forecasting
Jingmin Wang, Kanzhang Wu
PRICAI1