Reposted by Gregor
I will be giving a talk on open-vocabulary 3D scene understanding at the next ZurichCV meetup!
🗓️ Date: Thursday, January 23rd 18:00 CET
📍Location: @ETH_AI_Center, please see zurichai.ch/events/zurichcv-7 for additional details!
🗓️ Date: Thursday, January 23rd 18:00 CET
📍Location: @ETH_AI_Center, please see zurichai.ch/events/zurichcv-7 for additional details!
ZurichCV #7 | ZurichAI
Ayca Takmaz on open-vocabulary 3D scene understanding.
zurichai.ch
January 16, 2025 at 3:50 PM
I will be giving a talk on open-vocabulary 3D scene understanding at the next ZurichCV meetup!
🗓️ Date: Thursday, January 23rd 18:00 CET
📍Location: @ETH_AI_Center, please see zurichai.ch/events/zurichcv-7 for additional details!
🗓️ Date: Thursday, January 23rd 18:00 CET
📍Location: @ETH_AI_Center, please see zurichai.ch/events/zurichcv-7 for additional details!
Reposted by Gregor
BPE is a greedy method to find a tokeniser which maximises compression! Why don't we try to find properly optimal tokenisers instead? Well, it seems this is a pretty difficult—in fact, NP-complete—problem!🤯
New paper + @philipwitti.bsky.social
@gregorbachmann.bsky.social :) arxiv.org/abs/2412.15210
New paper + @philipwitti.bsky.social
@gregorbachmann.bsky.social :) arxiv.org/abs/2412.15210
Tokenisation is NP-Complete
In this work, we prove the NP-completeness of two variants of tokenisation, defined as the problem of compressing a dataset to at most $δ$ symbols by either finding a vocabulary directly (direct token...
arxiv.org
December 20, 2024 at 2:04 PM
BPE is a greedy method to find a tokeniser which maximises compression! Why don't we try to find properly optimal tokenisers instead? Well, it seems this is a pretty difficult—in fact, NP-complete—problem!🤯
New paper + @philipwitti.bsky.social
@gregorbachmann.bsky.social :) arxiv.org/abs/2412.15210
New paper + @philipwitti.bsky.social
@gregorbachmann.bsky.social :) arxiv.org/abs/2412.15210