technocracy

arXiv:2603.17092v1 Announce Type: new Abstract: Sim-to-real transfer of locomotion policies often leads to performance degradation due to the inevitable sim-to-real gap. Naively fine-tuning these policies directly on hardware is problematic, as it poses risks of mechanical failure and suffers from high sample inefficiency. In this paper, we address the challenge of safely and efficiently fine-tuning reinforcement learning (RL) policies for dynamic locomotion tasks. Specifically, we focus on fine-tuning policies learned in simulation directly on hardware, while explicitly enforcing […]

Ver mais

Table of Links Abstract and 1. Introduction Related Work Preliminaries and Notations Differentiable Structural Information 4.1. A New Formulation 4.2. Properties 4.3. Differentiability & Deep Graph Clustering LSEnet 5.1. Embedding Leaf Nodes 5.2. Learning Parent Nodes 5.3. Hyperbolic Partitioning Tree Experiments 6.1. Graph Clustering 6.2. Discussion on Structural Entropy Conclusion, Broader Impact, and References Appendix A. Proofs B. Hyperbolic Space C. Technical Details D. Additional Results 4.1. A New Formulation To bridge this gap, we present a new […]

Ver mais

arXiv:2602.06104v1 Announce Type: cross Abstract: Many engineering and scientific workflows depend on expensive black-box evaluations, requiring decision-making that simultaneously improves performance and reduces uncertainty. Bayesian optimization (BO) and Bayesian experimental design (BED) offer powerful yet largely separate treatments of goal-seeking and information-seeking, providing limited guidance for hybrid settings where learning and optimization are intrinsically coupled. We propose “pragmatic curiosity,” a hybrid learning-optimization paradigm derived from active inference, in which actions are selected by minimizing the expected free energy–a […]

Ver mais

arXiv:2601.21717v2 Announce Type: replace-cross Abstract: We establish sample complexity guarantees for estimating the covariance matrix of a strongly log-concave smooth distribution using the unadjusted Langevin algorithm (ULA). We quantitatively compare our complexity estimates on single-chain ULA with embarrassingly parallel ULA and derive that the sample complexity of the single-chain approach is smaller than that of embarrassingly parallel ULA by a logarithmic factor in the dimension and the reciprocal of the prescribed precision, with the difference arising from effective […]

Ver mais

arXiv:2602.16855v1 Announce Type: new Abstract: The paper introduces GUI-Owl-1.5, the latest native GUI agent model that features instruct/thinking variants in multiple sizes (2B/4B/8B/32B/235B) and supports a range of platforms (desktop, mobile, browser, and more) to enable cloud-edge collaboration and real-time interaction. GUI-Owl-1.5 achieves state-of-the-art results on more than 20+ GUI benchmarks on open-source models: (1) on GUI automation tasks, it obtains 56.5 on OSWorld, 71.6 on AndroidWorld, and 48.4 on WebArena; (2) on grounding tasks, it obtains 80.3 […]

Ver mais

arXiv:2601.09729v1 Announce Type: new Abstract: Financial reports and earnings communications contain large volumes of structured and semi structured information, making detailed manual analysis inefficient. Earnings conference calls provide valuable evidence about a firm’s performance, outlook, and strategic priorities. The manual analysis of lengthy call transcripts requires substantial effort and is susceptible to interpretive bias and unintentional error. In this work, we present a hybrid summarization framework that combines extractive and abstractive techniques to produce concise and factually reliable […]

Ver mais

When working on Spark jobs (in Scala), we often sequentially write the code in a single class, giving more attention to the transformations we do and forgetting how our code is structured or even if it’s tested. Today I’ll be talking about how I personally like to structure and design my Spark jobs, such as they are highly maintainable and testable.

Ver mais

A revenue dashboard drops 18% overnight. The pipeline is ‘green.’ The lineage graph looks right. Query history shows the job ran successfully. Yet you still can’t answer the only question leadership cares about: what changed—and can we prove it? Traditional lineage is built for discovery: it shows what depends on what. Incidents demand evidence: what exactly ran, on which versions, with which logic and checks, and what blast radius that run created. Graphs show paths; incidents require proof. […]

Ver mais

arXiv:2602.16811v1 Announce Type: new Abstract: Recent advancements in Natural Language Processing and Deep Learning have enabled the development of Large Language Models (LLMs), which have significantly advanced the state-of-the-art across a wide range of tasks, including Question Answering (QA). Despite these advancements, research on LLMs has primarily targeted high-resourced languages (e.g., English), and only recently has attention shifted toward multilingual models. However, these models demonstrate a training data bias towards a small number of popular languages or rely […]

Ver mais