ckpt 8B: huggingface.co/jiuhai/flore...
demo: huggingface.co/spaces/jiuha...
code: github.com/JiuhaiChen/F...
paper: arxiv.org/abs/2412.04424
ckpt 8B: huggingface.co/jiuhai/flore...
demo: huggingface.co/spaces/jiuha...
code: github.com/JiuhaiChen/F...
paper: arxiv.org/abs/2412.04424
git: github.com/modelscope/C...
demo: huggingface.co/spaces/aliba...
git: github.com/modelscope/C...
demo: huggingface.co/spaces/aliba...
Stretch AI - a new open-source suite of tools, tutorials, and reference code to explore and build AI-enabled home robot applications.
Stretch AI - a new open-source suite of tools, tutorials, and reference code to explore and build AI-enabled home robot applications.
🔗: www.liquid.ai/research/aut...
🔗: www.liquid.ai/research/aut...
paper: arxiv.org/abs/2411.19722
JetFormer unifies text and image modeling with a normalizing flow, enabling strong text-to-image generation and image understanding.
paper: arxiv.org/abs/2411.19722
JetFormer unifies text and image modeling with a normalizing flow, enabling strong text-to-image generation and image understanding.
paper: arxiv.org/abs/2411.19379
Marconi improves caching for hybrid LLMs with policies optimizing reuse likelihood and compute savings, achieving 34.4× higher token hit rates and significantly reducing latency.
paper: arxiv.org/abs/2411.19379
Marconi improves caching for hybrid LLMs with policies optimizing reuse likelihood and compute savings, achieving 34.4× higher token hit rates and significantly reducing latency.
code: github.com/PKU-HMI-Lab/...
paper: arxiv.org/abs/2411.18623
project: lift3d-web.github.io
code: github.com/PKU-HMI-Lab/...
paper: arxiv.org/abs/2411.18623
project: lift3d-web.github.io
paper: arxiv.org/abs/2411.18933
project page: yformer.github.io/efficient-tr...
paper: arxiv.org/abs/2411.18933
project page: yformer.github.io/efficient-tr...
Roblox paper: arxiv.org/abs/2411.19352
A CRS enhancing LLMs with 10+ tools improves recommendations and shares insights from design, evaluation, and deployment.
Roblox paper: arxiv.org/abs/2411.19352
A CRS enhancing LLMs with 10+ tools improves recommendations and shares insights from design, evaluation, and deployment.
paper: arxiv.org/abs/2411.19547
paper: arxiv.org/abs/2411.19547
paper: arxiv.org/abs/2411.19943
paper: arxiv.org/abs/2411.19943
paper: arxiv.org/abs/2411.19865
RevThink improves LLM reasoning by 13.53% using structured forward-backward reasoning, ensuring strong generalization and data efficiency.
paper: arxiv.org/abs/2411.19865
RevThink improves LLM reasoning by 13.53% using structured forward-backward reasoning, ensuring strong generalization and data efficiency.
paper: arxiv.org/abs/2411.19722
JetFormer unifies text and image modeling with a normalizing flow, enabling strong text-to-image generation and image understanding.
paper: arxiv.org/abs/2411.19722
JetFormer unifies text and image modeling with a normalizing flow, enabling strong text-to-image generation and image understanding.
paper: arxiv.org/abs/2411.19809
A plug-and-play model-free safety filter uses Q-learning to ensure safe actions in robotics, integrating easily with RL algorithms. Simulations and real-world tests confirm its effectiveness.
paper: arxiv.org/abs/2411.19809
A plug-and-play model-free safety filter uses Q-learning to ensure safe actions in robotics, integrating easily with RL algorithms. Simulations and real-world tests confirm its effectiveness.
paper: arxiv.org/abs/2411.19574
KV shifting attention enhances induction heads in LLMs improving efficiency, in-context learning, and faster convergence, even in models with over 10 billion parameters.
paper: arxiv.org/abs/2411.19574
KV shifting attention enhances induction heads in LLMs improving efficiency, in-context learning, and faster convergence, even in models with over 10 billion parameters.
The Token Sliding problem examines transforming one token configuration into another on a graph by sliding tokens while keeping independence. It is PSPACE-complete for various graph types but solvable in polynomial time for oriented cycles and cographs.
The Token Sliding problem examines transforming one token configuration into another on a graph by sliding tokens while keeping independence. It is PSPACE-complete for various graph types but solvable in polynomial time for oriented cycles and cographs.
The same 99% will happen here too, but if AI researchers continue to get perma-banned for making available the datasets needed to filter it, it’s going to make this platform unusable.
🔗: zenodo.org/records/1108...
🔗: huggingface.co/datasets/alp...
🔗: huggingface.co/datasets/inf...
🔗: huggingface.co/datasets/not...
🔗: zenodo.org/records/1108...
🔗: huggingface.co/datasets/alp...
🔗: huggingface.co/datasets/inf...
🔗: huggingface.co/datasets/not...
🔗: github.com/NVIDIA/Star-...
paper: arxiv.org/abs/2411.17116
🔗: github.com/NVIDIA/Star-...
paper: arxiv.org/abs/2411.17116