arXiv:2602.07182v1 Announce Type: new Abstract: Complexity in engineered systems presents one of the most persistent challenges in modern development since it is driving cost overruns, schedule delays, and outright project failures. Yet while architectural complexity has been studied, the structural complexity embedded within requirements specifications remains poorly understood and inadequately quantified. This gap is consequential: requirements fundamentally drive system design, and complexity introduced at this stage propagates through architecture, implementation, and integration. To address this gap, we build […]

Ver mais

arXiv:2512.19373v2 Announce Type: replace Abstract: In the development of learning systems, there is an ongoing need to reconcile the strong predictive performance offered by opaque black-box models with the level of transparency required for critical applications. This work introduces a methodological framework that combines spectral representation learning with transparent statistical modeling to construct a mixture of generalized additive models (GAMs). The approach utilizes random Fourier feature embeddings to uncover locally adaptive structures within the data. High-dimensional random feature […]

Ver mais

arXiv:2603.06631v1 Announce Type: new Abstract: Online grocery shopping presents unique challenges for sequential recommendations due to repetitive purchase patterns and complex item relationships within the baskets. Unlike traditional e-commerce, grocery recommendations must capture both complementary item associations and temporal dependencies across shopping sessions. To address these challenges in Amazon’s online grocery business, we propose T-REX, a novel transformer architecture that generates personalized category-level suggestions by learning both short-term basket dependencies and long-term user preferences. Our approach introduces three […]

Ver mais

arXiv:2509.20323v2 Announce Type: replace-cross Abstract: We prove the first guarantees of sparse recovery for ReLU neural networks, where the sparse network weights constitute the signal to be recovered. Specifically, we study structural properties of the sparse network weights for two-layer, scalar-output networks under which a simple iterative hard thresholding algorithm recovers these weights exactly, using memory that grows linearly in the number of nonzero weights. We validate this theoretical result with simple experiments on recovery of sparse planted […]

Ver mais

Published on October 11, 2025 4:29 PM GMT I’ve noticed an antipattern. It’s definitely on the dark pareto-frontier of “bad argument” and “I see it all the time amongst smart people”. I’m confident it’s the worst, common argument I see amongst rationalists and EAs. I don’t normally crosspost to the EA forum, but I’m doing it now. I call it Exhaustive Free Association. Exhaustive Free Association is a step in a chain of reasoning where the logic goes […]

Ver mais

We study the algorithmic task of testably learning general Massart halfspaces under the Gaussian distribution. In the testable learning setting, the aim is the design of a tester-learner pair satisfying the following properties: (1) if the tester accepts, the learner outputs a hypothesis and a certificate that it achieves near-optimal error, and (2) it is highly unlikely that the tester rejects if the data satisfies the underlying assumptions. Our main result is the first testable learning algorithm for […]

Ver mais

[D] PLEASE CAN ANYBODY TELL ME THAT FOR IJCAI REBUTTAL SUBMISSION DO WE HAVE TO SHOW REVIEWER MAPPING OR THEY CAN SEE THE ORDER SO WE SEE R1 R2 .. OR WE HAVE TO ADD R1 MEANS THE ENCODED ID AND ALSO DO WE HAVE TO MENTION PAPER TITLE AGAIN OR NOT ? submitted by /u/adi_gawd [link] [comments]

Ver mais

arXiv:2602.17822v1 Announce Type: new Abstract: Industrial robotics has established itself as an integral component of large-scale manufacturing enterprises. Simultaneously, collaborative robotics is gaining prominence, introducing novel paradigms of human-machine interaction. These advancements have necessitated a comprehensive revision of safety standards, specifically incorporating requirements for cybersecurity and protection against unauthorized access in networked robotic systems. This article presents a comparative analysis of the ISO 10218:2011 and ISO 10218:2025 standards, examining the evolution of their structure, terminology, technical requirements, and […]

Ver mais

arXiv:2602.07710v1 Announce Type: new Abstract: We study generation in separable metric instance spaces. We extend the language generation framework from Kleinberg and Mullainathan [2024] beyond countable domains by defining novelty through metric separation and allowing asymmetric novelty parameters for the adversary and the generator. We introduce the $(varepsilon,varepsilon’)$-closure dimension, a scale-sensitive analogue of closure dimension, which yields characterizations of uniform and non-uniform generatability and a sufficient condition for generation in the limit. Along the way, we identify a […]

Ver mais

In my previous analysis of Power Stranding, I explored the multi-billion-dollar art of ensuring that massive power infrastructure doesn’t sit idle. But for a data center financial analyst, solving the power equation isn’t just about building better substations. It’s about what sits inside the racks. Looking at a modern data center’s balance sheet in early 2026, the “Hardware” line item is undergoing a silent coup. For decades, the industry operated as a one-stop shop: cloud providers bought their […]

Ver mais