Meta-Learning for Cold-Start Personalization in Prompt-Tuned LLMs

Chengrui Zhou; Dannier Li; Huijie Shen; Lu Chang; Yinuo Yang; Yushang Zhao

REVIEW 4 major objections 6 minor 2 cited by

Meta-Learning for Cold-Start Personalization in Prompt-Tuned LLMs

T0 review · 4 major / 6 minor · reviewed 2026-08-06 · deepseek-v4-flash

Challenge this review Re-run · record.json Download PDF Read on arXiv ↗

Pith's one-line read A meta-learning loop over soft prompts lets a frozen LLM personalize recommendations after 1–5 user interactions.

desk verdict A standard meta-learning composition with unsupported empirical claims; the missing Amazon/Recbole results and hallucinated financial numbers make it unpublishable as is. read the letter →

arxiv 2507.16672 v1 pith:7ZRDKDQR submitted 2025-07-22 cs.LG cs.AI

Yushang Zhao , Huijie Shen , Dannier Li , Lu Chang , Chengrui Zhou , Yinuo Yang This is my paper · ORCID

classification cs.LGcs.AI

keywords meta-learningcold-startrecommendationprompttuningsoftpromptsMAMLReptilelargelanguagemodelsfew-shotpersonalization

verification ladder T0 review T1 audit T2 compute T3 formal

The pith

A machine-rendered reading of the paper's core claim, the machinery that carries it, and where it could break.

The reading

This paper aims to show that cold-start personalization for LLM-based recommenders can be achieved by meta-learning the initialization of a soft prompt. The authors treat each user as a task, adapt a prompt on a support set of 1–5 interactions, and optimize the prompt initialization over many users so that adaptation is fast. They report improvements over zero-shot, fine-tuning, static prompt-tuning, and LoRA baselines on MovieLens-1M, Amazon Books, and Recbole-Yelp, with 275 ms adaptation time and 510 MB peak memory. The same mechanism is claimed to support zero-history personalization, and the paper extends the idea to real-time financial risk monitoring, a direction that goes beyond the recommender experiments.

What carries the argument

The load-bearing object is the soft prompt $P$, a learnable vector sequence of length $l$ in the embedding dimension, prepended to the input tokens of a frozen LLM. The optimization is a two-loop meta-learning procedure: an inner loop performs task-specific gradient updates on $P$ using the support set, $\theta_i' = \theta - \alpha \nabla_\theta \mathcal{L}_{T_i}(\theta; D_i^{support})$, and an outer loop minimizes the sum of query-set losses over sampled user tasks, $\min_\theta \sum_i \mathcal{L}_{T_i}(\theta_i'; D_i^{query})$. Only the prompt parameters receive gradients; the LLM weights stay frozen. Reptile is used as a first-order alternative that updates the initialization toward the post-adaptation parameters without second derivatives. Episodic sampling with 1–5 support and query interactions per user makes the few-shot setting concrete.

What would settle it

Give a held-out user population from a domain not seen during meta-training, adapt each user's prompt with K=5 support interactions, and measure Hit@10 on held-out queries. If the adapted prompts perform no better than a zero-shot prompt for this population, the transferability assumption fails. The paper's own Books-to-Electronics experiment is the natural starting point: a larger degradation or reversal of the reported gains would falsify the central claim.

Watch

Extended reading notes

Core claim

The central claim is that a soft prompt, a learnable matrix $P \in \mathbb{R}^{l \times d}$ prepended to the tokenized input $[P; X]$, can act as a differentiable user-state representation. By applying MAML to the prompt space, the paper learns an initialization $\theta$ such that one to five gradient steps on a new user's support set produce a personalized prompt that performs well on the user's query set. On MovieLens-1M with $K=5$, the authors report Hit@10 of 0.748, nDCG@10 of 0.582, and MRR of 0.371, against 0.682, 0.495, and 0.316 for the best PEFT (LoRA) baseline. They also report that Reptile, a first-order approximation, reaches about 95% of MAML's performance with 198 ms adaptation time and 390 MB memory. The paper's own cross-domain test, Books to Electronics, shows a ~12% Hit@10 drop, which the authors attribute to heterogeneous user behavior across domains.

Load-bearing premise

The paper assumes that users' interactions are drawn independently from a shared distribution and that a prompt initialization optimized over that distribution transfers to never-seen users; the cross-domain Books-to-Electronics result shows this transfer can degrade by about 12% Hit@10.

Editorial extensions

If this is right

A recommender system could personalize for a completely new user within 300 ms on consumer hardware, without retraining the language model.
Storing a user's state reduces to saving a prompt of 20–30 tokens, making per-user personalization cheap at scale.
The same meta-learned prompt initialization could transfer to other per-session LLM tasks, since the backbone is frozen and the only task-specific part is the prompt.
Reptile's near-parity with MAML suggests that production systems can use the cheaper first-order method with minimal accuracy loss.
Zero-history users could be served directly by the meta-learned initialization, bypassing adaptation entirely, if the initialization captures population-level preferences.

Reading between the lines

Editorial extensions of the paper, not claims the author makes directly.

The paper reports a single K=5 table on MovieLens-1M with point estimates; the claimed financial-system figures (83% latency reduction, $28B in prevented bailouts) are not derived from any experiment in the paper and would need separate validation on payment-network data.
Because the meta-learning objective assumes user tasks are i.i.d., the observed Books-to-Electronics drop suggests that domain-aware task sampling or clustering would be needed for heterogeneous deployments; the paper names this as future work but does not test it.
The 275 ms adaptation time covers only the prompt update; end-to-end latency including inference and data retrieval could be larger, and a deployment test would need to measure the full loop.
If the prompt initialization truly transfers across users, the same mechanism could be applied to other cold-start problems such as clinical decision support or educational tutoring, where the paper sketches but does not evaluate these applications.

Share X Bluesky LinkedIn Reddit HN

Editorial analysis

A structured set of objections, weighed in public.

Desk editor's note, referee report, and a circularity audit.

Desk Editor's Note

read the letter

Xu, here's my read on 2507.16672. The stress-test is right: the paper's headline claim rests on one MovieLens-1M table with no error bars, and the promised Amazon and Recbole results never appear. That alone sinks the paper as written. The core idea—treating users as tasks and meta-learning a soft prompt initialization with MAML or Reptile—is a natural composition of well-known techniques. There's nothing genuinely new analytically, but the combination for LLM recommenders is reasonable and worth a paragraph in someone else's related work. The paper does give a clear problem formulation and a sensible evaluation protocol (support/query split with K=1-5), and the reported latency/memory numbers, if real, would be useful. But they are just point estimates from one dataset. No seeds, no variance, no significance tests, no ablation table with actual numbers despite claims in the text. The cross-domain result (Books→Electronics) is mentioned in prose but not shown as a table with baselines. The financial sections (5.4, 5.5) are a serious red flag: unsupported claims about SEC Rule 18c-3, FDIC simulations, and $28B in prevented bailouts come out of nowhere, with no methodology. That looks like hallucinated content, not scholarship. The reference list also contains many unrelated papers (robot navigation, CT image reconstruction, rock mechanics), which suggests citation padding or generated text. I agree with the reader's verdict. The paper's central empirical claim is unsubstantiated, and the missing data cannot be checked. It should be rejected. That said, the underlying question—whether meta-learned prompts help cold-start LLM recommenders—is legitimate, and a careful version of this study with full results, error bars, and code would be worth a look. But this version doesn't deserve referee time; it needs to be rewritten and re-evidenced first. Recommendation: desk reject, with an invitation to resubmit a complete version.

Referee Report

4 major / 6 minor

Summary. The paper proposes Meta-Prompt, a meta-learning framework for cold-start personalization in LLM-based recommender systems. Each user is treated as a task; soft prompt embeddings are meta-initialized with MAML or Reptile and adapted on 1-5 support interactions while the backbone LLM is frozen. The authors claim improvements over zero-shot, supervised fine-tuning, static prompt tuning, and PEFT baselines on MovieLens-1M, Amazon Reviews, and Recbole, with 275 ms adaptation time and low GPU memory. The paper further makes broad claims about real-time financial systemic-risk monitoring, clinical applications, and educational personalization.

Significance. If substantiated, the core empirical claim would be a useful engineering result: a frozen LLM personalized per cold-start user at low latency and modest memory. The method itself is a straightforward application of established meta-learning algorithms to soft prompts, so the novelty lies mainly in the deployment-oriented measurement. However, the evidence provided is far below the standard required for the claimed scope: one point-estimate table, no error bars or significance tests, no per-dataset results for two of the three datasets named in the abstract, no ablation table, and no code or data release. The paper contains no machine-checked proofs or reproducible artifacts; its main strength is a clear framing of few-shot personalization as meta-learning over soft prompts, which is plausible but not demonstrated with the presented evidence.

major comments (4)

[§4.4] The only quantitative evidence for the central empirical claim is the MovieLens-1M Results (K=5) table, which reports point estimates without standard deviations, confidence intervals, seeds, or significance tests. Section 4.4 states that results are reported on MovieLens-1M, Amazon Books, and Recbole-Yelp, but no table or metric for Amazon Books or Recbole-Yelp appears anywhere in the manuscript, despite the abstract claiming superior performance on all three datasets. This makes the headline claim unverifiable and is a load-bearing gap.
[§5.4 and §5.5] The financial implications sections assert specific quantitative outcomes—83% latency reduction, 34% acceleration of liquidity-spiral containment, and $28B in prevented annual bailouts—without any model, dataset, calculation, or citation of a validation study. The causal chain from a 275 ms prompt-adaptation time to macroprudential outcomes is not articulated. These claims cannot be checked and should be removed or fully substantiated; as written they materially overstate the paper's scope.
[§4.5] The ablation study is described only in prose. The MAML-versus-Reptile comparison is said to be 'shown in Table X,' but no such table appears in the manuscript; the Reptile numbers appear in an unnumbered floating table with no experimental setup, seeds, or variance. The claims about gradient steps, prompt length, learning-rate ranges, and task diversity are therefore not supported by any presented evidence.
[§5.3] The cross-domain result (Hit@10 = 0.631, MRR = 0.295) is reported without a comparator table, so the claim that this is '12-17 percent better than the static baselines' cannot be checked. More importantly, Section 5.3 concedes that real-world user behavior is heterogeneous and that the i.i.d. task assumption of Section 3.1 is violated in practice; no experiment addresses this distribution shift, so the few-shot transfer claim for cold-start deployment is not established.

minor comments (6)

[§3.5] The section is titled 'MAML vs. Reptile - Comparative Analysis' but contains no comparison; the comparison first appears in §4.5. Consider restructuring to move the comparative analysis entirely into the experiments section.
[§4.5] The learning-rate range is garbled in the text as '(α\alphaα)' and '? ∈ [3? − 5,5? − 4]'; please provide a clear numerical range with proper notation.
[§4.1 and §5.2] Figure 1 is referenced at the end of §4.1 and Figure 3 is referenced in §5.2, but no figures appear in the manuscript.
[References] Many references appear unrelated to the claims they are attached to; for example, [1] concerns NVM mapping, [2] concerns traffic sign recognition, [3] concerns splicing image detection, and [5] concerns drug sales volume prediction. The reference list should be brought in line with the topics actually cited.
[§5.5] The MIMIC-III pilot claim (18% improvement in Recall@10 over fine-tuned baselines) is presented without dataset size, prompt design, baselines, or uncertainty estimates. This should be removed or reported in full detail.
[Global] There is no statement about code or data release, and key hyperparameters (inner-loop learning rate, meta-training task counts, backbone details beyond '1.3B parameter decoder-only transformer') are missing. This hampers reproducibility.

Circularity Check

0 steps flagged · score 0.0 of 10

No circularity: the framework is a standard MAML/Reptile prompt-initialization method whose reported gains are empirical measurements, not quantities derived from its own assumptions.

full rationale

The paper's derivation chain is a direct application of MAML/Reptile to soft-prompt initialization: the inner loop adapts a task-specific prompt, the outer loop optimizes the initialization over sampled user tasks, and evaluation is then performed on held-out query interactions. No equation-level reduction occurs: the reported Hit@10, nDCG@10, and MRR values are measurements on a test protocol, not consequences of the optimization objective by construction. The central empirical claim (superiority over baselines) is not a fitted-input-renamed-as-prediction because the meta-initialization is trained on support/query splits and evaluated on unseen interactions; there is no parameter that is fit to the target metric and then reported as a prediction. The related-work self-citation [11] overlaps with the authors' prior work, but it is used only as context that prompt-tuning presumes existing user information and is not load-bearing for the method, the equations, or the empirical claims. The acknowledged i.i.d. assumption in Section 3.1 and the cross-domain degradation in Section 5.3 are correctness and generalizability concerns, not circularity. Missing Amazon/Recbole tables and absence of error bars are evidence-quality issues, not circular reasoning. The derivation is therefore self-contained with respect to the patterns enumerated for circularity.

Assumptions & free parameters 5 free parameters · 4 assumptions · 0 invented entities

The paper introduces no new physical or mathematical entities. Its unsupported financial claims are applications of the measured latency, not new entities.

free parameters (5)

Soft prompt length = 20 tokens
Set in Section 4.4; the ablation reports a sweet spot of 20-30 tokens, so reported metrics depend on this choice.
Inner-loop adaptation steps = 3 (per ablation; not stated in main table)
Ablation shows Hit@10 rising from 0.702 at 1 step to 0.748 at 3 steps, so the central table's value depends on the step count.
Support set size K = 5
Section 4.1 specifies K in {1,3,5}; the main table uses K=5, so performance for smaller K is not shown.
Inner-loop learning rate = not specified exactly; range 3e-5 to 5e-4 mentioned
Section 4.5 gives only a range; without an exact value, results cannot be reproduced.
Backbone LLM = 1.3B decoder-only transformer, architecture unspecified
Section 4.4 says the backbone is frozen and 1.3B, but the specific model is never named.

assumptions (4)

domain assumption User tasks are drawn i.i.d. from a distribution over users.
Section 3.1 formulates each user as a task from a distribution; Section 5.3 concedes real-world heterogeneity and a ~12% cross-domain drop.
ad hoc to paper Soft prompts can encode enough user-specific behavioral signal to improve ranking with 1-5 interactions.
The method prepends learnable vectors [P;X] (Section 3.3); the capacity of a 20-token prompt to capture user priors is assumed, not derived.
standard math MAML and Reptile optimization rules as written hold for prompt parameters.
Equations in Section 3.2 rely on standard differentiability of the loss with respect to prompt embedding, a conventional assumption for soft prompts.
ad hoc to paper A 275ms prompt-adaptation latency is causally relevant to financial stress testing and contagion monitoring.
Sections 5.4 and 5.5 assert 83% latency reduction and $28B bailout prevention without modeling payment networks or stress tests.

how reviews work

0 comments

Cite this review

Pith. "Pith review of Meta-Learning for Cold-Start Personalization in Prompt-Tuned LLMs." pith.science (2026). https://pith.science/paper/7ZRDKDQR

@misc{pith2026250716672,
  author       = {Pith},
  title        = {Pith review of: Meta-Learning for Cold-Start Personalization in Prompt-Tuned LLMs},
  year         = {2026},
  howpublished = {\url{https://pith.science/paper/7ZRDKDQR}},
  note         = {Machine review of arXiv:2507.16672}
}

read the original abstract

Generative, explainable, and flexible recommender systems, derived using Large Language Models (LLM) are promising and poorly adapted to the cold-start user situation, where there is little to no history of interaction. The current solutions i.e. supervised fine-tuning and collaborative filtering are dense-user-item focused and would be expensive to maintain and update. This paper introduces a meta-learning framework, that can be used to perform parameter-efficient prompt-tuning, to effectively personalize LLM-based recommender systems quickly at cold-start. The model learns soft prompt embeddings with first-order (Reptile) and second-order (MAML) optimization by treating each of the users as the tasks. As augmentations to the input tokens, these learnable vectors are the differentiable control variables that represent user behavioral priors. The prompts are meta-optimized through episodic sampling, inner-loop adaptation, and outer-loop generalization. On MovieLens-1M, Amazon Reviews, and Recbole, we can see that our adaptive model outperforms strong baselines in NDCG@10, HR@10, and MRR, and it runs in real-time (i.e., below 300 ms) on consumer GPUs. Zero-history personalization is also supported by this scalable solution, and its 275 ms rate of adaptation allows successful real-time risk profiling of financial systems by shortening detection latency and improving payment network stability. Crucially, the 275 ms adaptation capability can enable real-time risk profiling for financial institutions, reducing systemic vulnerability detection latency significantly versus traditional compliance checks. By preventing contagion in payment networks (e.g., Fedwire), the framework strengthens national financial infrastructure resilience.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

Instructional Prompt Optimization for Few-Shot LLM-Based Recommendations on Cold-Start Users
cs.AI 2025-09 reject novelty 3.0 of 10

A manuscript claims instructional prompt engineering improves LLM-based cold-start recommendation, but provides no reproducible evidence.
Multimodal Foundation Model-Driven User Interest Modeling and Behavior Analysis on Short Video Platforms
cs.IR 2025-09 reject novelty 3.0 of 10

A standard attention-fusion plus Transformer sequence model is applied to short-video recommendation, with claimed gains over weak baselines and no reproducible artifacts.

Reference graph

Works this paper leans on

35 extracted references · 19 canonical work pages · cited by 2 Pith papers

[1]

II-NVM: Enhancing Map Accuracy and Consistency with Normal Vector-Assisted Mapping[J]

Zhao C, Li Y, Jian Y, et al. II-NVM: Enhancing Map Accuracy and Consistency with Normal Vector-Assisted Mapping[J]. IEEE Robotics andAutomationLetters,2025

work page 2025
[2]

Wei Y, Gao M, XiaoJ, et al. Real-Time Traffic SignRecognition Based on Threshold Segmentation and Neural Networks[C]//2025 10th International Conference on Information and Network Technologies (ICINT).IEEE,2025:80-87

work page 2025
[3]

Xiang,A.,Zhang,J.,Yang,Q., Wang,L.,&Cheng,Y.(2024).Research on splicing image detection algorithms based on natural image statistical characteristics.arXivpreprintarXiv:2404.16296

arXiv 2024
[4]

Yu, D., Liu, L., Wu, S., Li, K., Wang, C., Xie, J., ... & Ji, R. (2025, March). Machine learning optimizes the efficiency of picking and packing in automated warehouse robot systems. In 2025 IEEE International Conference on Electronics, Energy Systems and Power Engineering(EESPE)(pp.1325-1332).IEEE

2025
[5]

A Deep Learning Algorithm Based on CNN- LSTM Framework for Predicting Cancer Drug Sales Volume[J]

Li Y, Yao Y, Lin J, et al. A Deep Learning Algorithm Based on CNN- LSTM Framework for Predicting Cancer Drug Sales Volume[J]. arXiv preprintarXiv:2506.21927,2025

arXiv 2025
[6]

Machine Learning-Based Prediction of Metal- Organic Framework Materials: A Comparative Analysis of Multiple Models[J].arXivpreprintarXiv:2507.04493,2025

Zheng Z, Liu K, Zhu X. Machine Learning-Based Prediction of Metal- Organic Framework Materials: A Comparative Analysis of Multiple Models[J].arXivpreprintarXiv:2507.04493,2025

arXiv 2025
[7]

Li, K., Liu, L., Chen, J., Yu, D., Zhou, X., Li, M., ... & Li, Z. (2024, November). Research on reinforcement learning based warehouse robot navigation algorithm in complex warehouse layout. In 2024 6th International Conference on Artificial Intelligence and Computer Applications(ICAICA)(pp.296-301).IEEE

work page 2024
[8]

CTLformer: A Hybrid Denoising Model Combining Convolutional Layers and Self-Attention for Enhanced CT Image Reconstruction

Zheng Z, Wu S, Ding W. CTLformer: A Hybrid Denoising Model Combining Convolutional Layers and Self-Attention for Enhanced CT ImageReconstruction[J].arXivpreprintarXiv:2505.12203,2025

work page Pith review arXiv 2025

Show all 35 references

[9]

Research on feature fusion and multimodal patent text based on graph attention network[J]

Song Z, Liu Z, Li H. Research on feature fusion and multimodal patent text based on graph attention network[J]. arXiv preprint arXiv:2505.20188,2025

2025 arXiv
[10]

User Behavior Analysis in Privacy ProtectionwithLargeLanguageModels:AStudyonPrivacyPreferences withLimitedData[J].arXivpreprintarXiv:2505.06305,2025

Yang H, Lu Q, Wang Y, et al. User Behavior Analysis in Privacy ProtectionwithLargeLanguageModels:AStudyonPrivacyPreferences withLimitedData[J].arXivpreprintarXiv:2505.06305,2025

2025 arXiv
[11]

ZhaoY,PengY,LiD,etal.ResearchonPersonalizedFinancialProduct Recommendation by Integrating Large Language Models and Graph NeuralNetworks[J].arXivpreprintarXiv:2506.05873,2025

2025 arXiv
[12]

IEEE, 2025:158-162

ZhouJ,WuY,ZhangY,etal.SemIRNet:ASemanticIronyRecognition Network for Multimodal Sarcasm Detection[C]//2025 10th International Conference on Information and Network Technologies (ICINT). IEEE, 2025:158-162

2025
[13]

Fan, P., Liu, K., & Qi, Z. (2025). Material Flow Prediction Task Based On TCN-GRU Deep Fusion Model. Preprints. https://doi.org/10.20944/preprints202505.2239.v1

2025
[14]

ZhaoQ,LaiF,MoX.Exploringtimeseriesanalysisinfrequencydomain withcomplex-valuedspectralattentionandbidirectionalvariablemamba: Q.Zhaoetal[J].TheJournalofSupercomputing,2025,81(8):875

2025
[15]

A novel Tree-augmented Bayesian network for predicting rock weathering degree using incomplete dataset[J].InternationalJournalofRockMechanicsandMiningSciences, 2024,183:105933

Wu C, Huang H, Chen J, et al. A novel Tree-augmented Bayesian network for predicting rock weathering degree using incomplete dataset[J].InternationalJournalofRockMechanicsandMiningSciences, 2024,183:105933

2024
[16]

Wu S,HuangX, Lu D.Psychologicalhealthknowledge-enhanced LLM- based social network crisis intervention text transfer recognition method[J].arXivpreprintarXiv:2504.07983,2025

2025 arXiv
[17]

Rock mass quality prediction on tunnel faces with incomplete multi-source dataset via tree-augmented naive Bayesian network[J]

Huang H, Wu C, Zhou M, et al. Rock mass quality prediction on tunnel faces with incomplete multi-source dataset via tree-augmented naive Bayesian network[J]. International Journal of Mining Science and Technology,2024,34(3):323-337

2024
[18]

Research on Multi-Modal Retrieval System of E-Commerce Platform Based on Pre-Training Model

Zhang, Bingbing, Yi Han, and Xiaofei Han. "Research on Multi-Modal Retrieval System of E-Commerce Platform Based on Pre-Training Model."ArtificialIntelligenceTechnologyResearch2.9(2025)

2025
[19]

Research on E-Commerce Long-Tail Product Recommendation Mechanism Based on Large-Scale Language Models[J].arXivpreprintarXiv:2506.06336,2025

Lu Q, Lyu H, Zheng J, et al. Research on E-Commerce Long-Tail Product Recommendation Mechanism Based on Large-Scale Language Models[J].arXivpreprintarXiv:2506.06336,2025

2025 arXiv
[20]

Personalized Risks and Regulatory Strategies of Large Language Models in Digital Advertising[J]

Feng H, Dai Y, Gao Y. Personalized Risks and Regulatory Strategies of Large Language Models in Digital Advertising[J]. arXiv preprint arXiv:2505.04665,2025

2025 arXiv
[21]

Enhancing Code LLMs with Reinforcement Learning in Code Generation[J]

Wang J, Zhang Z, He Y, et al. Enhancing Code LLMs with Reinforcement Learning in Code Generation[J]. arXiv preprint arXiv:2412.20367,2024

2024 arXiv
[22]

Regression and forecasting of us stock returns based on lstm

Zhou,S.,Zhang,Z.,Zhang,R.,Yin,Y.,Chang,C.H.,&Shen,Q.(2025, February). Regression and forecasting of us stock returns based on lstm. In Proceedings of the 2025 3rd International Conference on CommunicationNetworksandMachineLearning(pp.126-130)

2025
[23]

Analysis of collective response reveals that covid-19-related activities start from the end of 2019 in mainland china[J].medRxiv,2020:2020.10.14.20202531

Liu J, Huang T, Xiong H, et al. Analysis of collective response reveals that covid-19-related activities start from the end of 2019 in mainland china[J].medRxiv,2020:2020.10.14.20202531

2019
[24]

Huang B, Wei Y, Xiao J, et al. Proactive Reliability Governance in Complex Systems: Leveraging Pattern Mining for Scalable Solutions[C]//2025 10th International Conference on Information and NetworkTechnologies(ICINT).IEEE,2025:180-185

2025
[25]

Wu, S., Fu, L., Chang, R., Wei, Y., Zhang, Y., Wang, Z., ... & Li, K. (2025). Warehouse Robot Task Scheduling Based on Reinforcement LearningtoMaximizeOperationalEfficiency.AuthoreaPreprints

2025
[26]

Application ofAI inReal-time Credit Risk Detection[J].2025

WangZ, Zhang Q, ChengZ. Application ofAI inReal-time Credit Risk Detection[J].2025

2025
[27]

& Shi, T

Yi, Q., He, Y., Wang, J., Song, X., Qian, S., Zhang, M., ... & Shi, T. (2025). SCORE: Story Coherence and Retrieval Enhancement for AI Narratives.arXivpreprintarXiv:2503.23512

2025
[28]

(2024, August)

Xiang, A., Qi, Z., Wang, H., Yang, Q., & Ma, D. (2024, August). A multimodal fusion network for student emotion recognition based on transformer and tensor product. In 2024 IEEE 2nd International ConferenceonSensors,ElectronicsandComputerEngineering(ICSECE) (pp.1-4).IEEE

2024
[29]

Research on the Design of a Short Video Recommendation System Based on Multimodal Information and DifferentialPrivacy[J].arXivpreprintarXiv:2504.08751,2025.[n3-带队]

Yang H, Fu L, Lu Q, et al. Research on the Design of a Short Video Recommendation System Based on Multimodal Information and DifferentialPrivacy[J].arXivpreprintarXiv:2504.08751,2025.[n3-带队]

2025 arXiv
[30]

Enhanced Recommendation Combining Collaborative Filtering and Large Language Models[J]

Lin X, Cheng Z, Yun L, et al. Enhanced Recommendation Combining Collaborative Filtering and Large Language Models[J]. arXiv preprint arXiv:2412.18713,2024

2024 arXiv
[31]

LLM-Driven E-Commerce Marketing Content Optimization: Balancing Creativity and Conversion[J]

Yang H, Lyu H, Zhang T, et al. LLM-Driven E-Commerce Marketing Content Optimization: Balancing Creativity and Conversion[J]. arXiv preprintarXiv:2505.23809,2025

2025 arXiv
[32]

Ad Placement Optimization Algorithm Combined with MachineLearninginInternetE-Commerce[J].2025

Feng H, Gao Y. Ad Placement Optimization Algorithm Combined with MachineLearninginInternetE-Commerce[J].2025

2025
[33]

Financial analysis: Intelligent financial data analysis system based on llm-rag

Wang, Jingru, Wen Ding, and Xiaotong Zhu. "Financial analysis: Intelligent financial data analysis system based on llm-rag." arXiv preprintarXiv:2504.06279(2025)

2025 arXiv
[34]

arXiv preprint arXiv:2501.02167, 2025

TanC,ZhangW, QiZ, et al.GeneratingMultimodalImages withGAN: Integrating Text, Image, and Style[J]. arXiv preprint arXiv:2501.02167, 2025

2025 arXiv
[35]

ResearchonModelParallelism andData Parallelism Optimization Methods in Large Language Model-Based RecommendationSystems[J].arXivpreprintarXiv:2506.17551,2025

YangH,TianY, YangZ, etal. ResearchonModelParallelism andData Parallelism Optimization Methods in Large Language Model-Based RecommendationSystems[J].arXivpreprintarXiv:2506.17551,2025

2025 arXiv

Pith tools

Reviewed August 6, 2026 · model on record in the stance chip above.

[1] [1]

II-NVM: Enhancing Map Accuracy and Consistency with Normal Vector-Assisted Mapping[J]

Zhao C, Li Y, Jian Y, et al. II-NVM: Enhancing Map Accuracy and Consistency with Normal Vector-Assisted Mapping[J]. IEEE Robotics andAutomationLetters,2025

work page 2025

[2] [2]

Wei Y, Gao M, XiaoJ, et al. Real-Time Traffic SignRecognition Based on Threshold Segmentation and Neural Networks[C]//2025 10th International Conference on Information and Network Technologies (ICINT).IEEE,2025:80-87

work page 2025

[3] [3]

Xiang,A.,Zhang,J.,Yang,Q., Wang,L.,&Cheng,Y.(2024).Research on splicing image detection algorithms based on natural image statistical characteristics.arXivpreprintarXiv:2404.16296

arXiv 2024

[4] [4]

Yu, D., Liu, L., Wu, S., Li, K., Wang, C., Xie, J., ... & Ji, R. (2025, March). Machine learning optimizes the efficiency of picking and packing in automated warehouse robot systems. In 2025 IEEE International Conference on Electronics, Energy Systems and Power Engineering(EESPE)(pp.1325-1332).IEEE

2025

[5] [5]

A Deep Learning Algorithm Based on CNN- LSTM Framework for Predicting Cancer Drug Sales Volume[J]

Li Y, Yao Y, Lin J, et al. A Deep Learning Algorithm Based on CNN- LSTM Framework for Predicting Cancer Drug Sales Volume[J]. arXiv preprintarXiv:2506.21927,2025

arXiv 2025

[6] [6]

Machine Learning-Based Prediction of Metal- Organic Framework Materials: A Comparative Analysis of Multiple Models[J].arXivpreprintarXiv:2507.04493,2025

Zheng Z, Liu K, Zhu X. Machine Learning-Based Prediction of Metal- Organic Framework Materials: A Comparative Analysis of Multiple Models[J].arXivpreprintarXiv:2507.04493,2025

arXiv 2025

[7] [7]

Li, K., Liu, L., Chen, J., Yu, D., Zhou, X., Li, M., ... & Li, Z. (2024, November). Research on reinforcement learning based warehouse robot navigation algorithm in complex warehouse layout. In 2024 6th International Conference on Artificial Intelligence and Computer Applications(ICAICA)(pp.296-301).IEEE

work page 2024

[8] [8]

CTLformer: A Hybrid Denoising Model Combining Convolutional Layers and Self-Attention for Enhanced CT Image Reconstruction

Zheng Z, Wu S, Ding W. CTLformer: A Hybrid Denoising Model Combining Convolutional Layers and Self-Attention for Enhanced CT ImageReconstruction[J].arXivpreprintarXiv:2505.12203,2025

work page Pith review arXiv 2025