🚨⚠️ I HAVE REACHED HUGGING FACE'S FREE STORAGE LIMIT ⚠️🚨
I can no longer upload new models unless I can cover the cost of additional storage. I host 70+ free models as an independent contributor and this work is unpaid. Without your support, no more new models can be uploaded.
Your help will motivate me and would go into further improving my workflow and coverings fees for storage, compute and may even help uncensoring bigger model with rental Cloud GPUs.
Lower refusals indicate fewer content restrictions, while lower KL divergence indicates more closeness to the original model's baseline. Higher refusals cause more rejections, objections, pushbacks, lecturing, censorship, softening and deflections.
We introduce LongCat-Flash-Lite, a non-thinking 68.5B parameter Mixture-of-Experts (MoE) model with approximately 3B activated parameters, supporting a 256k context length through the YaRN method. Building upon the LongCat-Flash architecture, LongCat-Flash-Lite distinguishes itself through the integration of an N-gram embedding table designed to enhance both model performance and inference speed. Despite allocating over 30B parameters to embeddings, LongCat-Flash-Lite not only outperforms parameter-equivalent MoE baselines but also demonstrates exceptional competitiveness against existing models of comparable scale, particularly in the agentic and coding domains.
Key Features
🌟 Superior Scaling Efficiency: A Better Alternative to MoE
Through comprehensive scaling experiments across diverse scenarios, we identify specific regimes where embedding scaling achieves a superior Pareto frontier compared to increasing the number of experts, thereby offering a highly efficient alternative for model scaling. We further delineate a comprehensive set of architectural factors that determine embedding scaling efficacy, encompassing integration timing, parameter budgeting, hash collision mitigation, hyperparameter configuration, and embedding initialization, alongside the impacts of model width and depth.
🌟 Superior Inference Efficiency with Specialized System Optimization
In contrast to FFN-based experts, the N-gram embedding table inherently mitigates I/O bottlenecks within MoE layers, yielding substantial improvements in inference latency. Furthermore, we introduce a specialized N-gram Cache and develop synchronized kernels, which collectively and significantly boost inference efficiency.
🌟 Strong Agentic and Coding Performance
LongCat-Flash-Lite demonstrates robust capabilities in agentic tool use and coding proficiency that are highly competitive relative to its model scale.
Note: Values marked with * are sourced from public reports. NE is an abbreviation of N-gram Embedding.
Quick Start
To use LongCat-Flash-Lite with transformers, we need at least 2 GPUs (80GB VRAM each, e.g., H100/A100 80GB), and we recommend the following environment:
1from transformers import AutoModelForCausalLM, AutoTokenizer
23model_name ="meituan-longcat/LongCat-Flash-Lite"4model = AutoModelForCausalLM.from_pretrained(5 model_name,6 torch_dtype="auto",7 device_map="auto",8 trust_remote_code=True9)10tokenizer = AutoTokenizer.from_pretrained(model_name, trust_remote_code=True)1112messages =[13{"role":"system","content":"You are a helpful assistant."},14{"role":"user","content":"Give me a brief introduction to large language models."}15]16input_ids = tokenizer.apply_chat_template(17 messages,18 add_generation_prompt=True,19 return_tensors="pt"20).to(model.device)21generated_ids = model.generate(inputs=input_ids, max_new_tokens=256)22output_ids = generated_ids[0][len(input_ids[0]):].tolist()23response = tokenizer.decode(output_ids, skip_special_tokens=True).strip("\n")24print(response)
Tool Calling Example:
py
1tools =[2{3"type":"function",4"function":{5"name":"func_add",6"description":"Calculate the sum of two numbers",7"parameters":{8"type":"object",9"properties":{10"x1":{"type":"number","description":"The first addend"},11"x2":{"type":"number","description":"The second addend"}12},13"required":["x1","x2"]14}15}16}17]18messages =[19{"role":"system","content":"You are a helpful assistant."},20{"role":"user","content":"Please tell me what is $$125679 + 234519$$?"},21{22"role":"assistant",23"content":"I'll calculate the sum of 125679 and 234519 for you.",24"tool_calls":[{"type":"function","function":{"name":"func_add","arguments":{"x1":125679,"x2":234519}}}]25},26{"role":"tool","name":"func_add","content":'{"ans": 360198}'}27]2829input_ids = tokenizer.apply_chat_template(30 messages,31 tools=tools,32 add_generation_prompt=True,33 return_tensors="pt"34).to(model.device)35generated_ids = model.generate(inputs=input_ids, max_new_tokens=256)36output_ids = generated_ids[0][len(input_ids[0]):].tolist()37response = tokenizer.decode(output_ids, skip_special_tokens=True).strip("\n")38print(response)
This repository, including both the model weights and the source code, is released under the MIT License.
Any contributions to this repository are licensed under the MIT License, unless otherwise stated. This license does not grant any rights to use Meituan trademarks or patents.
This model has not been specifically designed or comprehensively evaluated for every possible downstream application.
Developers should take into account the known limitations of large language models, including performance variations across different languages, and carefully assess accuracy, safety, and fairness before deploying the model in sensitive or high-risk scenarios.
It is the responsibility of developers and downstream users to understand and comply with all applicable laws and regulations relevant to their use case, including but not limited to data protection, privacy, and content safety requirements.
Nothing in this Model Card should be interpreted as altering or restricting the terms of the MIT License under which the model is released.
Citation
We kindly encourage citation of our work if you find it useful.
@misc{liu2026scalingembeddingsoutperformsscaling,
title={Scaling Embeddings Outperforms Scaling Experts in Language Models},
author={Hong Liu and Jiaqi Zhang and Chao Wang and Xing Hu and Linkun Lyu and Jiaqi Sun and Xurui Yang and Bo Wang and Fengcun Li and Yulei Qian and Lingtong Si and Yerui Sun and Rumei Li and Peng Pei and Yuchen Xie and Xunliang Cai},
year={2026},
eprint={2601.21204},
archivePrefix={arXiv},
primaryClass={cs.CL},
url={https://arxiv.org/abs/2601.21204},
}