arXiv:2508.04444v2 Announce Type: replace-cross Abstract: In this paper, we propose new randomized algorithms for estimating the two-to-infinity and one-to-two norms in a matrix-free setting, using only matrix-vector multiplications. Our methods are based on appropriate modifications of Hutchinson’s diagonal estimator and its Hutch++ version. We provide oracle complexity bounds for both modifications. We further illustrate the practical utility of our algorithms for Jacobian-based regularization in deep neural network training on image classification tasks. We also demonstrate that our methodology […]

Ver mais

Hey guys, I had written a paper as part of my capstone project last year but never published it. My then advisor gave a green light for me to upload to arxiv but they could not endorse me. If anyone here can do it I would greatly appreciate it. To endorse another user to submit to the cs.RO (Robotics) subject class, an arXiv submitter must have submitted 3 papers to any of cs.AI, cs.AR, cs.CC, cs.CE, cs.CG, cs.CL, […]

Ver mais

The software engineering industry relies heavily on Large Language Models (LLMs) accessed via flat-rate web subscriptions, operating under the assumption of infinite, highly available compute. However, the paradigm of “unlimited compute” is fundamentally incompatible with the physical constraints of data centers. Surging enterprise demand and massive context windows have forced AI providers to introduce peak-hour usage rationing. In metropolitan hubs, the concentration of demand leads to significant rate-limiting during standard business hours (08:00–14:00 EST). In empirical observations of […]

Ver mais

arXiv:2603.28998v1 Announce Type: new Abstract: As Large Language Models (LLMs) and multi-agent AI systems are demonstrating increasing potential in cybersecurity operations, organizations, policymakers, model providers, and researchers in the AI and cybersecurity communities are interested in quantifying the capabilities of such AI systems to achieve more autonomous SOCs (security operation centers) and reduce manual effort. In particular, the AI and cybersecurity communities have recently developed several benchmarks for evaluating the red team capabilities of multi-agent AI systems. However, […]

Ver mais

arXiv:2603.15641v1 Announce Type: new Abstract: Recursive reasoning models such as Hierarchical Reasoning Model (HRM) and Tiny Recursive Model (TRM) show that small, weight-shared networks can solve compute-heavy and NP puzzles by iteratively refining latent states, but their training typically relies on deep supervision and/or long unrolls that increase wall-clock cost and can bias the model toward greedy intermediate behavior. We introduce Recursive Stem Model (RSM), a recursive reasoning approach that keeps the TRM-style backbone while changing the training […]

Ver mais

Remember when choosing a database was simple? You picked MySQL or PostgreSQL for transactional data, maybe added MongoDB if you needed flexibility, and called it a day. I remember a conversation with a colleague regarding sharding, a method for horizontal scaling in MongoDB. Those days are over. The database landscape is going through the biggest shift since the NoSQL movement of the 2010s. But this time, it’s not just about scale or flexibility. Two forces are reshaping everything: […]

Ver mais

Unsupervised object-centric learning models, particularly slot-based architectures, have shown great promise in decomposing complex scenes. However, their reliance on reconstruction-based training creates a fundamental conflict between the sharp, high-frequency attention maps of the encoder and the spatially consistent but blurry reconstruction maps of the decoder. We identify that this discrepancy gives rise to a vicious cycle: the noisy feature map from the encoder forces the decoder to average over possibilities and produce even blurrier outputs, while the gradient […]

Ver mais

I’ve been testing Claude’s ability to generate Lean 4 code to prove theorems. I’ve written about a couple experiments that verified calculations. I did not write about my failed attempt to get Claude to formalize a proof of the pqr theorem for seminorms. This time I asked Claude to formally prove the theorem from the previous post on partial fraction decomposition in an abstract setting. Unlike the previous experiments, I did not give it a proof or calculation […]

Ver mais