Search

We present a diffusion-based approach to quadrupedal locomotion that simultaneously addresses the limitations of learning and interpolating between multiple skills and of (modes) offline adapting to new locomotion behaviours after training. This is the first framework to apply classifier-free guided diffusion to quadruped locomotion and demonstrate its efficacy by extracting goal-conditioned behaviour from an originally unlabelled dataset. We show that these capabilities are compatible with a multi-skill policy and can be applied with little modification and minimal compute overhead, i.e., running entirely on the robots onboard CPU. We verify the validity of our approach with hardware experiments on the ANYmal quadruped platform.

Fine-tuning is a crucial paradigm for adapting pre-trained large language models to downstream tasks. Recently, methods like Low-Rank Adaptation (LoRA) have been shown to match the performance of fully fine-tuned models on various tasks with an extreme reduction in the number of trainable parameters. Even in settings where both methods learn similarly accurate models, \emph{are their learned solutions really equivalent?} We study how different fine-tuning methods change pre-trained models by analyzing the model's weight matrices through the lens of their spectral properties. We find that full fine-tuning and LoRA yield weight matrices whose singular value decompositions exhibit very different structure; moreover, the fine-tuned models themselves show distinct generalization behaviors when tested outside the adaptation task's distribution. More specifically, we first show that the weight matrices trained with LoRA have new, high-ranking singular vectors, which we call \emph{intruder dimensions}. Intruder dimensions do not appear during full fine-tuning. Second, we show that LoRA models with intruder dimensions, despite achieving similar performance to full fine-tuning on the target task, become worse models of the pre-training distribution and adapt less robustly to multiple tasks sequentially. Higher-rank, rank-stabilized LoRA models closely mirror full fine-tuning, even when performing on par with lower-rank LoRA models on the same tasks. These results suggest that models updated with LoRA and full fine-tuning access different parts of parameter space, even when they perform equally on the fine-tuned distribution. We conclude by examining why intruder dimensions appear in LoRA fine-tuned models, why they are undesirable, and how their effects can be minimized.

Ballots are the core records of elections. Electronic records of actual ballots cast (cast vote records) are available to the public in some jurisdictions. However, they have been released in a variety of formats and have not been independently evaluated. Here we introduce a database of cast vote records from the 2020 U.S. general election. We downloaded publicly available unstandardized cast vote records, standardized them into a multi-state database, and extensively compared their totals to certified election results. Our release includes vote records for President, Governor, U.S. Senate and House, and state upper and lower chambers -- covering 42.7 million voters in 20 states who voted for more than 2,204 candidates. This database serves as a uniquely granular administrative dataset for studying voting behavior and election administration. Using this data, we show that in battleground states, 1.9 percent of solid Republicans (as defined by their congressional and state legislative voting) in our database split their ticket for Joe Biden, while 1.2 percent of solid Democrats split their ticket for Donald Trump., Comment: 26 pages and appendix

The sensitivity of electron EDM experiments has been increasing at a rapid pace, and could yield indications of new physics in the coming decade. An intriguing possibility is that an EDM signal could be generated by new, electroweak-charged particles at the TeV scale that couple to the Higgs and contribute to the electron EDM at two-loop order via Barr-Zee diagrams. A high-energy muon collider could decisively search for new physics at this scale. In this work, we explore this complementarity between colliders and EDM experiments, and note that Barr-Zee diagrams from the aforementioned particles are closely related to vector-boson scattering processes at a muon collider. These loop corrections lead to kinematic features in the differential cross sections of these processes, dictated by the optical theorem. We demonstrate this connection in the context of the singlet-doublet and doublet-triplet extensions to the SM, explore the detectability of these features at a muon collider experiment, and discuss how these measurements can be used to ascertain the underlying model parameters., Comment: 22 pages + appendices, 9 figures

We propose and experimentally demonstrate a novel detection method that significantly improves the precision of real-time measurement of the three-dimensional displacement of a levitated dipolar scatterer. Our technique relies on the spatial mode decomposition of the light scattered by the levitated object, allowing us to simultaneously and selectively extract the position information of all translational degrees of freedom with minimal losses. To this end, we collect all the light back-scattered from a levitated nanoparticle using a parabolic mirror and couple it into a spatial mode sorter. The sorter effectively demultiplexes the information content of the scattered electric field, resulting in each of the nanoparticle's translational degrees of freedom being selectively encoded in the amplitude of orthogonal optical modes. We report measurement efficiencies of ${(\eta_{^{\mathrm{tot}}}^{_{x}}, \eta_{^{\mathrm{tot}}}^{_{y}}, \eta_{^{\mathrm{tot}}}^{_{z}}) = (0.14, 0.16, 0.32)}$ $>$ 1/9, which should enable the 3D motional quantum ground state of a levitated optomechanical system. Further, we believe this technique opens up the possibility to implement coherent feedback control of a levitated nanoparticle.

We implement the first open-source quantum computing emulator that includes arithmetic operations, the quantum Fourier transform, and quantum phase estimation. The emulator provides significant savings in both temporal and spatial resources compared to simulation, and these computational advantages are verified through comparison to the Intel Quantum Simulator. We also demonstrate how to use the emulator to implement Shor's algorithm and use it to solve a nontrivial factoring problem. This demonstrates that emulation can make quantum computing more accessible than simulation or noisy hardware by allowing researchers to study the behavior of algorithms on large problems in a noiseless environment.

This review paper describes the energy-upgraded CEBAF accelerator. This superconducting linac has achieved 12 GeV beam energy by adding 11 new high-performance cryomodules containing eighty-eight superconducting cavities that have operated CW at an average accelerating gradient of 20 MV/m. After reviewing the attributes and performance of the previous 6 GeV CEBAF accelerator, we discuss the upgraded CEBAF accelerator system in detail with particular attention paid to the new beam acceleration systems. In addition to doubling the acceleration in each linac, the upgrade included improving the beam recirculation magnets, adding more helium cooling capacity to allow the newly installed modules to run cold, adding a new experimental hall, and improving numerous other accelerator components. We review several of the techniques deployed to operate and analyze the accelerator performance, and document system operating experience and performance. In the final portion of the document, we present much of the current planning regarding projects to improve accelerator performance and enhance operating margins, and our plans for ensuring CEBAF operates reliably into the future. For the benefit of potential users of CEBAF, the performance and quality measures for beam delivered to each of the experimental halls is summarized in the appendix., Comment: 66 pages, 73 figures, 21 tables

There is evidence that magnetism can potentially increase the thermopower of materials, most likely due to magnon scattering, suggesting the incorporation of intrinsic magnetic semiconductors in non-magnetic thermoelectric materials. Here, samples of $\textit{p}$-type Bi$_{0.5}$Sb$_{1.5}$Te$_{3}$ with 10 at.% excess Te are ball-milled with varying ratio of the antiferromagnetic semiconductor CrSb (0, 0.125, 0.5, and 1 wt.%) to prepare bulk samples by spark plasma sintering technique. The thermopower of samples containing CrSb is increased due to an increase in the effective mass of the charge carriers, indicating that there is a drag effect originating from the magnetic particles. However, this was at the expense of reduced electrical conductivity caused by reduced charge carrier mobility. While overall only marginal improvements in power factors were observed, these samples exhibited significantly lower thermal conductivity compared to the single-phase material. As a result, a peak $\textit{zT}$ value of $\sim$1.4 was achieved at 325 K for the sample with 0.125 wt.% CrSb. These results highlight the potential of incorporating magnetic secondary phases to enhance the thermoelectric performance of materials.

Since the dawn of scanning probe microscopy (SPM), tapping or intermittent contact mode has been one of the most widely used imaging modes. Manual optimization of tapping mode not only takes a lot of instrument and operator time, but also often leads to frequent probe and sample damage, poor image quality and reproducibility issues for new types of samples or inexperienced users. Despite wide use, optimization of tapping mode imaging is an extremely hard problem, ill-suited to either classical control methods or machine learning. Here we introduce a reward-driven workflow to automate the optimization of SPM in the tapping mode. The reward function is defined based on multiple channels with physical and empirical knowledge of good scans encoded, representing a sample-agnostic measure of image quality and imitating the decision-making logic employed by human operators. This automated workflow gives optimal scanning parameters for different probes and samples and gives high-quality SPM images consistently in the attractive mode. This study broadens the application and accessibility of SPM and opens the door for fully automated SPM., Comment: 20 pages, 6 figures

Physical imaging is a foundational characterization method in areas from condensed matter physics and chemistry to astronomy and spans length scales from atomic to universe. Images encapsulate crucial data regarding atomic bonding, materials microstructures, and dynamic phenomena such as microstructural evolution and turbulence, among other phenomena. The challenge lies in effectively extracting and interpreting this information. Variational Autoencoders (VAEs) have emerged as powerful tools for identifying underlying factors of variation in image data, providing a systematic approach to distilling meaningful patterns from complex datasets. However, a significant hurdle in their application is the definition and selection of appropriate descriptors reflecting local structure. Here we introduce the scale-invariant VAE approach (SI-VAE) based on the progressive training of the VAE with the descriptors sampled at different length scales. The SI-VAE allows the discovery of the length scale dependent factors of variation in the system. Here, we illustrate this approach using the ferroelectric domain images and generalize it to the movies of the electron-beam induced phenomena in graphene and topography evolution across combinatorial libraries. This approach can further be used to initialize the decision making in automated experiments including structure-property discovery and can be applied across a broad range of imaging methods. This approach is universal and can be applied to any spatially resolved data including both experimental imaging studies and simulations, and can be particularly useful for exploration of phenomena such as turbulence, scale-invariant transformation fronts, etc.

Gauge theories in $d$ dimensions with a nontrivial fundamental group admit a $(d-3)$-form magnetic symmetry and a $(d-5)$-form instantonic symmetry. These are examples of Chern-Weil symmetries, with conserved currents built out of the gauge field strength, which can only be explicitly broken through violations of the Bianchi identity. For U(1) gauge theory, it is clear that magnetic monopoles violate not only the $(d-3)$-form magnetic symmetry but also lower-form symmetries like the instantonic symmetry. It is also known that an improved instanton number symmetry current, which is conserved, can be constructed in the case that the magnetic monopole admits a dyonic excitation. We study the generalization to other gauge groups, showing that magnetic monopoles also violate instantonic symmetries for nonabelian groups like PSU($n$), and that dyon modes can restore such symmetries. Furthermore, we show that in many (but not all) examples where a gauge group $G$ is Higgsed to a gauge group $H$, the structure of monopoles and dyons emerging from the Higgsing process explicitly breaks the instantonic symmetries of $H$ to those of $G$. The meaning of explicit breaking of a $(d-5)$-form symmetry is clearest for $d > 4$, but these results also extend to $d = 4$, where the breaking is interpreted as an obstruction to coupling the theory to a background axion field., Comment: 49 pages, 3 figures

Supported metal nanoparticle (NP) catalysts are vital for the sustainable production of chemicals, but their design and implementation are limited by the ability to identify and characterize their structures and atomic sites that are correlated with high catalytic activity. Identification of these ''active sites'' has relied heavily on extrapolation to supported NP systems from investigation of idealized surfaces, experimentally using single crystals or supported NPs which are always modelled computationally using slab or regular polyhedra models. However, the ability of these methods to predict catalytic activity remains qualitative at best, as the structure of metal NPs in reactive environments has only been speculated from indirect experimental observations, or otherwise remains wholly unknown. Here, by circumventing these limitations for highly accurate simulation methods, we provide direct atomistic insight into the dynamic restructuring of metal NPs by combining in situ spectroscopy with molecular dynamics simulations powered by a machine learned force field. We find that in reactive environments, NP surfaces evolve to a state with poorly defined atomic order, while the core of the NP may remain bulk-like. These insights prove that long-standing conceptual models based on idealized faceting for small metal NP systems are not representative of real systems under exposure to reactive environments. We show that the resultant structure can be elucidated by combining advanced spectroscopy and computational tools. This discovery exemplifies that to enable faithful quantitative predictions of catalyst function and stability, we must move beyond idealized-facet experimental and theoretical models and instead employ systems which include realistic surface structures that respond to relevant physical and chemical conditions., Comment: 18 pages, 11 figures (4 main, 7 SI)

In the current era of noisy intermediate-scale quantum (NISQ) technology, quantum devices present new avenues for addressing complex, real-world challenges including potentially NP-hard optimization problems. This work aims to showcase how the inherent noise in NISQ devices can be leveraged to solve such real-world problems effectively. Utilizing a D-Wave quantum annealer and IonQ's gate-based NISQ computers, we generate and analyze solutions for managing train traffic under stochastic disturbances. Our case study focuses on the Baltimore Light RailLink, which embodies the characteristics of both tramway and railway networks. We explore the feasibility of using NISQ technology to model the stochastic nature of disruptions in these transportation systems. Our research marks the inaugural application of both quantum computing paradigms to tramway and railway rescheduling, highlighting the potential of quantum noise as a beneficial resource in complex optimization scenarios.

Simon's algorithm was one of the first problems to demonstrate a genuine quantum advantage. The algorithm, however, assumes access to noise-free qubits. In our work we use Simon's algorithm to benchmark the error rates of devices currently available in the "quantum cloud." As a main result we obtain an objective comparison between the different physical platforms made available by IBM and IonQ. Our study highlights the importance of understanding the device architectures and chip topologies when transpiling quantum algorithms onto hardware. For instance, we demonstrate that two-qubit operations on spatially separated qubits on superconducting chips should be avoided.

Axions arising as modes of higher-dimensional gauge fields are known to offer a compelling solution to the axion quality problem and to naturally arise in string theory. In this context, it is interesting to ask how we would interpret an experimental measurement of the axion decay constant $f$. I give several arguments for, as well as concrete examples in string theory of, the existence in such a model of an axion string with tension of order $2\pi S_\mathrm{inst} f^2$, where $S_\mathrm{inst}$ is the instanton action. Furthermore, in models of this type axion strings are typically fundamental objects (rather than solitons), whose tension is at or above the fundamental cutoff of the theory. As a result, I argue that for an extra-dimensional QCD axion, it is likely that the fundamental cutoff scale lies at most two orders of magnitude above $f$. In addition to these core arguments, this paper begins with a self-contained introduction to the physics of extra-dimensional axions and ends with some comments on axion physics in relation to chiral fermions., Comment: 36 pages plus references, 1 figure

The rapid development of computation power and machine learning algorithms has paved the way for automating scientific discovery with a scanning probe microscope (SPM). The key elements towards operationalization of automated SPM are the interface to enable SPM control from Python codes, availability of high computing power, and development of workflows for scientific discovery. Here we build a Python interface library that enables controlling an SPM from either a local computer or a remote high-performance computer (HPC), which satisfies the high computation power need of machine learning algorithms in autonomous workflows. We further introduce a general platform to abstract the operations of SPM in scientific discovery into fixed-policy or reward-driven workflows. Our work provides a full infrastructure to build automated SPM workflows for both routine operations and autonomous scientific discovery with machine learning., Comment: 16 pages, 7 figures

Discourse relation classification is an especially difficult task without explicit context markers (Prasad et al., 2008). Current approaches to implicit relation prediction solely rely on two neighboring sentences being targeted, ignoring the broader context of their surrounding environments (Atwell et al., 2021). In this research, we propose three new methods in which to incorporate context in the task of sentence relation prediction: (1) Direct Neighbors (DNs), (2) Expanded Window Neighbors (EWNs), and (3) Part-Smart Random Neighbors (PSRNs). Our findings indicate that the inclusion of context beyond one discourse unit is harmful in the task of discourse relation classification.

To understand the complexity of global events, one must navigate a web of interwoven sub-events, identifying those most impactful elements within the larger, abstract macro-event framework at play. This concept can be extended to the field of natural language processing (NLP) through the creation of structured event schemas which can serve as representations of these abstract events. Central to our approach is the Schema Curation Interface 3.0 (SCI 3.0), a web application that facilitates real-time editing of event schema properties within a generated graph e.g., adding, removing, or editing sub-events, entities, and relations directly through an interface.

There is growing recognition among financial institutions, financial regulators and policy makers of the importance of addressing nature-related risks and opportunities. Evaluating and assessing nature-related risks for financial institutions is challenging due to the large volume of heterogeneous data available on nature and the complexity of investment value chains and the various components' relationship to nature. The dual problem of scaling data analytics and analysing complex systems can be addressed using Artificial Intelligence (AI). We address issues such as plugging existing data gaps with discovered data, data estimation under uncertainty, time series analysis and (near) real-time updates. This report presents potential AI solutions for models of two distinct use cases, the Brazil Beef Supply Use Case and the Water Utility Use Case. Our two use cases cover a broad perspective within sustainable finance. The Brazilian cattle farming use case is an example of greening finance - integrating nature-related considerations into mainstream financial decision-making to transition investments away from sectors with poor historical track records and unsustainable operations. The deployment of nature-based solutions in the UK water utility use case is an example of financing green - driving investment to nature-positive outcomes. The two use cases also cover different sectors, geographies, financial assets and AI modelling techniques, providing an overview on how AI could be applied to different challenges relating to nature's integration into finance. This report is primarily aimed at financial institutions but is also of interest to ESG data providers, TNFD, systems modellers, and, of course, AI practitioners., Comment: 67 pages, 10 figures, UKRI (NERC) Integrated Finance and Biodiversity for a Nature Positive Future Programme

Conversation is the subject of increasing interest in the social, cognitive, and computational sciences. And yet, as conversational datasets continue to increase in size and complexity, researchers lack scalable methods to segment speech-to-text transcripts into conversational turns--the basic building blocks of social interaction. We introduce "NaturalTurn," a turn segmentation algorithm designed to accurately capture the dynamics of naturalistic exchange. NaturalTurn operates by distinguishing speakers' primary conversational turns from listeners' secondary utterances, such as backchannels, brief interjections, and other forms of parallel speech that characterize conversation. Using data from a large conversation corpus, we show how NaturalTurn-derived transcripts demonstrate favorable statistical and inferential characteristics compared to transcripts derived from existing methods. The NaturalTurn algorithm represents an improvement in machine-generated transcript processing methods, or "turn models" that will enable researchers to associate turn-taking dynamics with the broader outcomes that result from social interaction, a central goal of conversation science., Comment: 37 pages, 5 figures

Spontaneous breaking of symmetries leads to universal phenomena. We extend this notion to $(-1)$-form U(1) symmetries. The spontaneous breaking is diagnosed by a dependence of the vacuum energy on a constant background field $\theta$, which can be probed by the topological susceptibility. This leads to a reinterpretation of the Strong CP problem as arising from a spontaneously broken instantonic symmetry in QCD. We discuss how known solutions to the problem are unified in this framework and explore some, so far unsuccessful, attempts to find new solutions., Comment: 42 pages; v2: minor changes, accepted for publication in SciPost

A coloring of a graph is an assignment of colors to vertices such that no two neighboring vertices have the same color. The need for memory-efficient coloring algorithms is motivated by their application in computing clique partitions of graphs arising in quantum computations where the objective is to map a large set of Pauli strings into a compact set of unitaries. We present Picasso, a randomized memory-efficient iterative parallel graph coloring algorithm with theoretical sublinear space guarantees under practical assumptions. The parameters of our algorithm provide a trade-off between coloring quality and resource consumption. To assist the user, we also propose a machine learning model to predict the coloring algorithm's parameters considering these trade-offs. We provide a sequential and a parallel implementation of the proposed algorithm. We perform an experimental evaluation on a 64-core AMD CPU equipped with 512 GB of memory and an Nvidia A100 GPU with 40GB of memory. For a small dataset where existing coloring algorithms can be executed within the 512 GB memory budget, we show up to 68x memory savings. On massive datasets we demonstrate that GPU-accelerated Picasso can process inputs with 49.5x more Pauli strings (vertex set in our graph) and 2,478x more edges than state-of-the-art parallel approaches., Comment: Accepted by IPDPS 2024

Optimal and safety-critical control are fundamental problems for stochastic systems, and are widely considered in real-world scenarios such as robotic manipulation and autonomous driving. In this paper, we consider the problem of efficiently finding optimal and safe control for high-dimensional systems. Specifically, we propose to use dimensionality reduction techniques from a comparison theorem for stochastic differential equations together with a generalizable physics-informed neural network to estimate the optimal value function and the safety probability of the system. The proposed framework results in substantial sample efficiency improvement compared to existing methods. We further develop an autoencoder-like neural network to automatically identify the low-dimensional features of the system to enhance the ease of design for system integration. We also provide experiments and quantitative analysis to validate the efficacy of the proposed method. Source code is available at https://github.com/jacobwang925/path-integral-PINN., Comment: Accepted at the AAAI 24 conference

It is difficult to construct a post-inflation QCD axion model that solves the axion quality problem (and hence the Strong CP problem) without introducing a cosmological disaster. In a post-inflation axion model, the axion field value is randomized during the Peccei-Quinn phase transition, and axion domain walls form at the QCD phase transition. We emphasize that the gauge equivalence of all minima of the axion potential (i.e., domain wall number one) is insufficient to solve the cosmological domain wall problem. The axion string on which a domain wall ends must exist as an individual object (as opposed to a multi-string state), and it must be produced in the early universe. These conditions are often not satisfied in concrete models. Post-inflation axion models also face a potential problem from fractionally charged relics; solving this problem often leads to low-energy Landau poles for Standard Model gauge couplings, reintroducing the quality problem. We study several examples, finding that models that solve the quality problem face cosmological problems, and vice versa. This is not a no-go theorem; nonetheless, we argue that it is much more difficult than generally appreciated to find a viable post-inflation QCD axion model. Successful examples may have a nonstandard cosmological history (e.g., multiple types of cosmic axion strings of different tensions), undermining the widespread expectation that the post-inflation QCD axion scenario predicts a unique mass for axion dark matter., Comment: 34 pages, 3 figures. v2: references added, expanded discussion of Landau pole constraint, as published in JHEP

In this paper, we present RESIN-EDITOR, an interactive event graph visualizer and editor designed for analyzing complex events. Our RESIN-EDITOR system allows users to render and freely edit hierarchical event graphs extracted from multimedia and multi-document news clusters with guidance from human-curated event schemas. RESIN-EDITOR's unique features include hierarchical graph visualization, comprehensive source tracing, and interactive user editing, which is more powerful and versatile than existing Information Extraction (IE) visualization tools. In our evaluation of RESIN-EDITOR, we demonstrate ways in which our tool is effective in understanding complex events and enhancing system performance. The source code, a video demonstration, and a live website for RESIN-EDITOR have been made publicly available., Comment: The first two authors contribute equally to this paper

The Poisson-Boltzmann (PB) model governs the electrostatics of solvated biomolecules, i.e., potential, field, energy, and force. These quantities can provide useful information about protein properties, functions, and dynamics. By considering the advantages of current algorithms and computer hardware, we focus on the parallelization of the treecode-accelerated boundary integral (TABI) PB solver using the Message Passing Interface (MPI) on CPUs and the direct-sum boundary integral (DSBI) PB solver using KOKKOS on GPUs. We provide optimization guidance for users when the DSBI solver on GPU or the TABI solver with MPI on CPU should be used depending on the size of the problem. Specifically, when the number of unknowns is smaller than a predetermined threshold, the GPU-accelerated DSBI solver converges rapidly thus has the potential to perform PB model-based molecular dynamics or Monte Carlo simulation. As practical appliations, our parallelized boundary integral PB solvers are used to solve electrostatics on selected proteins that play significant roles in the spread, treatment, and prevention of COVID-19 virus diseases. For each selected protein, the simulation produces the electrostatic solvation energy as a global measurement and electrostatic surface potential for local details.

Probabilistic breadth-first traversals (BPTs) are used in many network science and graph machine learning applications. In this paper, we are motivated by the application of BPTs in stochastic diffusion-based graph problems such as influence maximization. These applications heavily rely on BPTs to implement a Monte-Carlo sampling step for their approximations. Given the large sampling complexity, stochasticity of the diffusion process, and the inherent irregularity in real-world graph topologies, efficiently parallelizing these BPTs remains significantly challenging. In this paper, we present a new algorithm to fuse massive number of concurrently executing BPTs with random starts on the input graph. Our algorithm is designed to fuse BPTs by combining separate traversals into a unified frontier on distributed multi-GPU systems. To show the general applicability of the fused BPT technique, we have incorporated it into two state-of-the-art influence maximization parallel implementations (gIM and Ripples). Our experiments on up to 4K nodes of the OLCF Frontier supercomputer ($32,768$ GPUs and $196$K CPU cores) show strong scaling behavior, and that fused BPTs can improve the performance of these implementations up to 34$\times$ (for gIM) and ~360$\times$ (for Ripples)., Comment: 12 pages, 11 figures

We analyze the amplitude fluctuations in a diluted 3D classical XY model near the magnetic phase transition, motivated by the unusual localization properties of the amplitude (Higgs) mode recently found at the disordered superfluid-Mott glass quantum phase transition. We calculate the amplitude correlation function and the corresponding scalar susceptibility by means of Monte Carlo simulations. In contrast to the quantum case, in which the scalar susceptibility was found to violate naive scaling, we find that the scalar susceptibility of the classical system fulfills naive scaling (employing the clean critical exponents, as expected from the Harris criterion) as the temperature is varied across the phase transition for several dilutions. We discuss possible reasons for this discrepancy as well as the generality of our findings., Comment: 8 pages, 8 figures embedded, final version as published