Edge-Ai

TL;DR for operators A robot can perceive more of its environment than its planner should necessarily receive. In the experiments summarized here, adding task-irrelevant objects to structured scene representations increases the burden on classical planners and can leave harder problems unsolved. The proposed response is not a new end-to-end planner. It is a learned relevance layer that decides which objects and relations should survive into the planning problem. ...

TL;DR for operators An edge device can have enough compute to run an LLM yet still fail the deployment because too many weights must remain resident in memory. Shrinking the representation through quantization is one response, but it couples several engineering choices together. SelectInfer1 proposes another control surface. In its primary configuration, it loads 70% of FFN neurons but computes 40%, keeping the loaded weights at full precision. On Llama3.2-3B, reported peak memory falls from 6.88 GB to 5.97 GB. On the same Jetson Orin Nano evaluation, decoding throughput is reported at 9.85 tokens/s, compared with 6.41 tokens/s for 4-bit bitsandbytes quantization and 0.75 tokens/s for disk offloading. ...

TL;DR for operators A small model can perform acceptably after task specialization and still lose more accuracy than expected when compressed. The paper examined here suggests that part of that loss may be shaped earlier, during fine-tuning, rather than being determined by the quantizer alone. Paper evidence: Muon-optimized models lost less accuracy after quantization than Adam-optimized models on six of eight benchmarks. On ARC-e, for example, accuracy fell by 0.55 percentage points after quantization with Muon versus 3.16 points with Adam. The integrated pipeline also produced a 2.86 GB quantized model from a 6.01 GB pre-quantized model while improving reported serving throughput and roughly halving per-token latency. ...

TL;DR for operators A team trying to move a transformer onto a phone, camera, robot, or embedded device has several levers: reduce the model, lower numerical precision, change the runtime, or move to a better accelerator. Hema Hariharan Samson’s survey of lightweight transformers1 suggests these choices cannot be evaluated independently. In the paper’s analyzed batch-size-1 setting, smaller workloads can become limited by how quickly the device moves model data rather than by raw arithmetic capacity; the paper reports roughly 60–75% hardware utilization in a favorable 15–40M-parameter range. Its broader comparisons similarly show that INT8 execution, operator fusion, optimized runtimes, and specialized accelerators change realized latency by very different amounts across devices. For an operator, the practical target is not the smallest model. It is the smallest accuracy loss that satisfies the product’s measured latency and energy budget on the actual deployment hardware. ...

TL;DR for operators A team shrinking an audio classifier for a low-cost screening device has more than one place to spend scarce compute. The network can stay larger, or the input representation can do more work before the signal reaches the network. That trade-off became visible when this heart-sound CNN was reduced from three convolutional blocks to two. Using a plain log-mel spectrogram, modified accuracy—a score that gives equal weight to abnormal-case sensitivity and normal-case specificity—fell from 0.910 to 0.826. With a front-end that normalizes each frequency band against its recent energy so locally unusual sounds stand out more clearly, called PCEN, it fell only from 0.915 to 0.894. A front-end representing the same sound at several time-frequency resolutions, called multi-resolution log-mel, similarly fell from 0.916 to 0.894. ...

TL;DR for operators A household assistant should not spend the same computational effort on “turn on the light” as on “make the room comfortable.” It also should not treat one unusual request as a permanent preference change. AdaHome applies that principle through tiered local processing. Explicit commands take a short planning path, while requests that need interpretation or personal context receive additional reasoning, validation, and—where appropriate—user confirmation. Under a common Llama 3.2-3B setup, it achieved 86.7% success on both direct and indirect commands while recording the lowest latency and token use in every command category among the compared systems. ...

TL;DR for operators A federated-learning client repeatedly downloads a model, computes locally, and uploads an update while the mobile network assigns radio resources to each step. Encryption hides the transmitted contents, but not the timing, direction, allocation size, and recurring cadence created by this training cycle. FLINT1 reconstructs those scheduling traces and uses them to classify CNN, RNN, and Transformer families. With a 300-second observation window, it reaches a macro F1 of 0.930 ± 0.021 in the evaluated closed-world testbed. ...

TL;DR for operators A deployed model encounters a familiar operating condition again. Should it relearn the task, search for a saved configuration, or let a trained controller decide which parameters to reuse? The paper’s strongest result points to the simpler mechanism. Removing the searchable store of compressed task-specific configurations increased recovery from 1.27 to 13.33 adaptation steps—close to the 14.27 steps required by a baseline without that store. The component that looks least intelligent therefore accounts for most of the recovery advantage: retaining the small parameter modules that worked before and restoring them when the task returns. The paper calls this store the TaskKnowledgeBank. ...

TL;DR for operators ABot-C0 is best understood as a behavior production system for quadruped robots, not as one giant model that accepts any instruction and directly controls every motor. It combines a 16,074-clip motion library, a generalist motion tracker, several specialized locomotion and interaction policies, and a deployment layer that decides which controller should be active. ...

TL;DR for operators Compression is usually sold as a tidy pipeline: pick a smaller architecture, prune some layers, quantize the result, then call procurement and explain why the GPU bill is still rude. This paper argues that the pipeline itself is the problem.1 The authors propose a joint compression framework for Llama-3.1-8B that searches architectural choices and quantization choices together. That means the system does not first decide “how much model” it wants and only afterward decide “how many bits” each part deserves. It treats width, depth, layer importance, weight precision, activation precision, and latency as interacting deployment variables. ...