Video wird geladen...

Video konnte nicht geladen werden

Zur Startseite

ANTHROPIC 🔥: Claude will soon receive a new file-based memory upgrade, offering users the option to choose between Memory Files and Classic memory. > Organized notes Claude writes as you chat and reads when they're relevant. Browse and edit them anytime. This feature appears to be a new iteration...

419,772 Aufrufe • vor 2 Monaten •via X (Twitter)

0 Kommentare

Keine Kommentare verfügbar

Kommentare vom Original-Post werden hier angezeigt

Ähnliche Videos

Love and Deepspace | Rerun Event Preview The 5-Star Rate UP Pool [Twilight Serenity] Limited-Time Rerun will start soon! "Then, you're not allowed to change your mind even after a hundred years. Or a thousand." 💫Event Duration: From 05:00 on Dec. 11 to 04:59 on Dec. 18 (Server Time) 💫The 5-Star Rate UP Pool [Twilight Serenity] Limited-Time Rerun Event 1. During the event, make a wish with [Deepspace Wish] or [Time Wish: Limited] to participate in the wish event. The drop rate of the event-limited 5-Star Memory [Rafayel: Fireworks Vow] will go up drastically. 2. After the event ends, this limited 5-Star Memory will not be obtainable through other means and will not enter the permanent Wish Pool: Xspace Echo. 3. All Rerun Wish Pools share one pity system. A 5-Star Memory is guaranteed within a specific attempt of wishes. If the 5-Star Memory you have obtained from the Rerun Wish Pool is not the event-limited Memory, you will obtain the event-limited Memory the next time you obtain a 5-Star Memory. The pity count from the last Rerun Wish Pool can be applied to this Rerun Wish Pool, and the pity count in this Rerun Wish Pool will also be applied to the upcoming Rerun Wish Pool. *You can read more about the event on the in-game rules page. 🎁New Packs During the event, the Rerun event-exclusive [Flamebloom Pack] series, which includes [Time Wish: Limited] and other materials, will be available in Shop. Notes: 1. [Time Wish: Limited] can be used in 5-Star Memory Wish Pool Rerun and will be used first when you make a wish. 2. After the event ends, [Time Wish: Limited] will automatically convert to Empyrean Wish. ——— 🪐Official Discord: #LoveandDeepspace #Rafayel

Love and Deepspace

304,066 Aufrufe • vor 7 Monaten

Claude Design + Shopify is f*cking ridiculous 🤯 You can now publish pages from Claude Design → Claude Code → Shopify. Built 100% with Claude Design, Claude Code, and the Shopify CLI. Perfect for DTC brands and agencies who want to skip the design → dev handoff entirely. Here's how it works: → Design any landing page in Claude Design → Export as a zip and drop it into Claude Code → Install the Shopify + Shopify AI Toolkit plugins → Prompt Claude to convert the HTML into a Shopify page template + push to live theme → Claude uploads the images, deploys the files, and creates a published page No more handing designs off to a dev and waiting 2 weeks for a Shopify page. What you get: - A workflow that turns any Claude Design page into a real Shopify page template - Editable sections so your marketing team can swap copy, images, and CTAs without code - Images uploaded straight to Shopify Files automatically - A files-only deploy that only touches what's new in your live theme - A repeatable pipeline you can use every time you design a new landing page This is essentially the design-to-deploy pipeline brands have been waiting for. I put together a step-by-step playbook for going from Claude Design → published Shopify page. Every install, every plugin, every command, and the exact prompt that runs the whole thing. Want the playbook for free? > Like this post > Comment "SHOP" And I'll send it over (must be following so I can DM)

Mike Futia

57,469 Aufrufe • vor 2 Monaten

Researchers made KMeans 200x faster. And the new technique also beats approaches like cuML and FAISS. Flash-KMeans is an IO-aware implementation of exact KMeans that redesigns the algorithm around modern GPU bottlenecks. By attacking the memory bottlenecks directly, Flash-KMeans achieves: - 33x speedup over cuML - 200x speedup over FAISS This speedup comes from how it moves through GPU memory. Standard KMeans runs in two steps, and both are bottlenecked by reads and writes to GPU memory: 1) The first step matches every point to its nearest centroid. Standard KMeans computes the full point-to-centroid distance matrix, writes it out to GPU memory, then reads it back to find each nearest centroid. That write-then-read round trip is the bottleneck. Flash-KMeans combines the distance calculation with the nearest-centroid step, so the result is computed on-chip and the full matrix is never written out. 2) The second step recomputes each centroid by averaging the points assigned to it. Standard KMeans has thousands of threads writing into the same centroid slots at once, so they stall waiting for their turn. Flash-KMeans sorts points by cluster first, turning scattered writes into sequential reductions that read and write memory in one efficient pass. Using these two optimizations at the million-scale, Flash-KMeans completes a standard KMeans iteration in a few milliseconds. The video below depicts this in action. Several reasons why this is important: KMeans has always been an offline primitive. Something you run once to preprocess data and move on. These speedups make the approach viable in several runtime-critical systems. ↳ Vector indices like FAISS use KMeans to build search indices. Faster KMeans means you can re-index dynamically as data changes. ↳ LLM quantization methods need KMeans to find optimal weight codebooks, per layer, repeatedly. What takes hours could now take minutes. ↳ MoE models need fast token routing at inference time. Flash-KMeans makes it viable to run this inside the inference loop, not just in preprocessing. I have shared the paper in the replies. That said, memory is the real constraint Flash-KMeans solves, and the problem is not just limited to clustering. The vectors a RAG system stores after indexing create similar bottlenecks. I wrote a detailed walkthrough recently on cutting this vector memory by 32x with binary quantization, querying 36M+ vectors in a few milliseconds. Read it below.

Avi Chawla

89,234 Aufrufe • vor 1 Monat