Weight-space models learn directly from the parameters of neural networks, enabling tasks such as predicting their accuracy on new datasets. Naive methods — like applying MLPs to flattened parameters — perform poorly, making the design of better weight-space architectures a central challenge. While prior work leveraged permutation symmetries in standard networks to guide such designs, no analogous analysis or tailored architecture yet exists for Kolmogorov-Arnold Networks (KANs). In this work, we show that KANs share the same permutation […]

Ver mais

TIL: Downloading archived Git repositories from archive.softwareheritage.org Back in February I blogged about a neat Python library called sqlite-s3vfs for accessing SQLite databases hosted in an S3 bucket, released as MIT licensed open source by the UK government’s Department for Business and Trade. I went looking for it today and found that the github.com/uktrade/sqlite-s3vfs repository is now a 404. Since this is taxpayer-funded open source software I saw it as my moral duty to try and restore access! […]

Ver mais

arXiv:2601.17009v1 Announce Type: new Abstract: Drones are becoming more and more popular nowadays. They are small in size, low in cost, and reliable in operation. They contain a variety of sensors and can perform a variety of flight tasks, reaching places that are difficult or inaccessible for humans. Earthquakes damage a lot of infrastructure, making it impossible for rescuers to reach some areas. But drones can help. Many amateur and professional photographers like to use drones for aerial […]

Ver mais

Hey everyone, I’m building a project for my university Machine Learning course called “Social network analysis using iterated game theory” and I’ve hit a wall. What I’m doing and how it should work: The goal of the project is to simulate how real human societies build trust. I have 100 agents playing the Iterated Prisoner’s Dilemma, placed on different complex network topologies (like Watts-Strogatz “villages” vs. Barabási-Albert “cities”). Initially i thought of it as a RL project but […]

Ver mais

arXiv:2601.02377v1 Announce Type: new Abstract: The integration of Large Language Models (LLMs) into robotics has revolutionized their ability to interpret complex human commands and execute sophisticated tasks. However, such paradigm shift introduces critical security vulnerabilities stemming from the ”embodiment gap”, a discord between the LLM’s abstract reasoning and the physical, context-dependent nature of robotics. While security for text-based LLMs is an active area of research, existing solutions are often insufficient to address the unique threats for the embodied […]

Ver mais

Victoria, Seychelles, April 13, 2026 CoinGecko has released its Spot CEX Report 2026, offering a comprehensive analysis of 12 leading centralized exchanges across multiple dimensions, including spot trading volume, market share trends, token listings, and reserve holdings. The report highlights that MEXC, the world leader in 0‑fee digital asset trading, increased its spot market share from 5% to 9% over the past two years—nearly doubling its position. Concurrently, MEXC ranked first among all major exchanges with 1,333 new […]

Ver mais

arXiv:2601.09033v1 Announce Type: new Abstract: Generative AI (GenAI) is increasingly used in academic writing, yet its effects on students’ writing self-efficacy remain contingent on how assistance is configured. This pilot study investigates how ideation-level, sentence-level, full-process, and no AI support differentially shape undergraduate writers’ self-efficacy using a 2 by 2 experimental design with Korean undergraduates completing argumentative writing tasks. Results indicate that AI assistance does not uniformly enhance self-efficacy full AI support produced high but stable self-efficacy alongside […]

Ver mais

arXiv:2602.08151v1 Announce Type: cross Abstract: We consider the problem of prediction with expert advice for “easy” sequences. We show that a variant of NormalHedge enjoys a second-order $epsilon$-quantile regret bound of $Obig(sqrt{V_T log(V_T/epsilon)}big) $ when $V_T > log N$, where $V_T$ is the cumulative second moment of instantaneous per-expert regret averaged with respect to a natural distribution determined by the algorithm. The algorithm is motivated by a continuous time limit using Stochastic Differential Equations. The discrete time analysis […]

Ver mais