Dynamic functional connectivity (dFC) derived from resting-state functional magnetic resonance imaging (fMRI) has been extensively utilized in brain science research. The sliding window correlation (SWC) method is a widely used approach for constructing dFC by computing correlation coefficients between amplitude time series of signals from pairs of brain regions. In this study, we propose an integrated approach that incorporates both amplitude and phase information of fMRI signals to improve the detection of brain disorders. Specifically, we introduce a multi-scale fusion learning framework, namely MSFL, which leverages two complementary dFC features derived from SWC and phase synchronization (PS). Here, SWC captures amplitude correlations, while PS measures phase coherence within dFC. We evaluated the efficacy of MSFL in classifying autism spectrum disorder and major depressive disorder using two publicly available datasets: ABIDE I and REST-meta-MDD, respectively. The results indicate that MSFL significantly outperforms existing comparative models. Moreover, we performed model explanation analysis using the SHAP framework, which showed that both types of dFC features from SWC and PS contribute to detecting brain disorders.

Machine learning models have recently emerged to predict whether hypothetical solid-state materials can be synthesized. These models aim to circumvent direct first-principles modeling of solid-state phase transformations, instead learning from large databases of successfully synthesized materials. Here, we assess the alignment of several recently introduced synthesis prediction models with material and reaction thermodynamics, quantified by the energy with respect to the convex hull and a metric accounting for thermodynamic selectivity of enumerated synthesis reactions. A dataset of successful synthesis recipes was used to determine the likely bounds on both quantities beyond which materials can be deemed unlikely to be synthesized. With these bounds as context, thermodynamic quantities were computed using the CHGNet foundation potential for thousands of new hypothetical materials generated using the Chemeleon generative model. Four recently published machine learning models for synthesizability prediction were applied to this same dataset, and the resultant predictions were considered against computed thermodynamics. We find these models generally overpredict the likelihood of synthesis, but some model scores do trend with thermodynamic heuristics, assigning lower scores to materials that are less stable or do not have an available synthesis recipe that is calculated to be thermodynamically selective. In total, this work identifies existing gaps in machine learning models for materials synthesis and introduces a new approach to assess their quality in the absence of extensive negative examples (failed syntheses).

In this paper, we demonstrate how to enhance the validity of causal inference with unstructured high-dimensional treatments like texts, by leveraging the power of generative Artificial Intelligence (GenAI). Specifically, we propose to use a deep generative model such as large language models (LLMs) to efficiently generate treatments and use their internal representation for subsequent causal effect estimation. We show that the knowledge of this true internal representation helps disentangle the treatment features of interest, such as specific sentiments and certain topics, from other possibly unknown confounding features. Unlike existing methods, the proposed GenAI-Powered Inference (GPI) methodology eliminates the need to learn causal representation from the data, and hence produces more accurate and efficient estimates. We formally establish the conditions required for the nonparametric identification of the average treatment effect, propose an estimation strategy that avoids the violation of the overlap assumption, and derive the asymptotic properties of the proposed estimator through the application of double machine learning. Finally, using an instrumental variables approach, we extend the proposed GPI methodology to the settings in which the treatment feature is based on human perception. The GPI is also applicable to text reuse where an LLM is used to regenerate existing texts. We conduct simulation and empirical studies, using the generated text data from an open-source LLM, Llama 3, to illustrate the advantages of our estimator over state-of-the-art causal representation learning algorithms.

We propose KG-ER, a conceptual schema language for knowledge graphs that describes the structure of knowledge graphs independently of their representation (relational databases, property graphs, RDF) while helping to capture the semantics of the information stored in a knowledge graph.

An adaptive bandwidth selection procedure for the mixture kernel in the maximum mean discrepancy (MMD) for fitting generative moment matching networks (GMMNs) is introduced, and improved learning of copula random number generators is demonstrated. Based on the relative error of the training loss, the number of kernels is increased during training; additionally, the relative error of the validation loss is used as an early stopping criterion. While training time remains similar, adaptively training GMMNs (AGMMNs) significantly increases training performance, which is shown based on validation MMD trajectories, samples and validation MMD values. Superiority of AGMMNs over GMMNs and parametric copula models is also demonstrated in terms of three applications. First, convergence rates of estimators based on quasi-random versus pseudo-random samples from copulas are investigated in dimensions as large as 100 for the first time. Second, replicated validation MMDs, as well as Monte Carlo and quasi-Monte Carlo applications demonstrate the improved training of AGMMNs for a copula model implied by the 50 constituents of the S&P 500 index after deGARCHing. Last, both the latter dataset and 50 constituents of the FTSE 100 are used to demonstrate that the improved training of AGMMNs indeed translates to an improved model prediction.

Neural cryptography is the application of artificial neural networks in the subject of cryptography. The functionality of this solution is based on a tree parity machine. It uses artificial neural networks to perform secure key exchange between network entities. This article proposes improvements to the synchronization of two tree parity machines. The improvement is based on learning artificial neural network using input vectors which have a wider range of values than binary ones. As a result, the duration of the synchronization process is reduced. Therefore, tree parity machines achieve common weights in a shorter time due to the reduction of necessary bit exchanges. This approach improves the security of neural cryptography

Trained recurrent networks are powerful tools for modeling dynamic neural computations. We present a target-based method for modifying the full connectivity matrix of a recurrent network to train it to perform tasks involving temporally complex input/output transformations. The method introduces a second network during training to provide suitable "target" dynamics useful for performing the task. Because it exploits the full recurrent connectivity, the method produces networks that perform tasks with fewer neurons and greater noise robustness than traditional least-squares (FORCE) approaches. In addition, we show how introducing additional input signals into the target-generating network, which act as task hints, greatly extends the range of tasks that can be learned and provides control over the complexity and nature of the dynamics of the trained, task-performing network.

We propose a semiparametric local projection estimator of nonlinear impulse response functions for a broad class of structural dynamic models relevant for applied macroeconomics, including models with nonlinearly transformed regressors, state dependent coefficients, and nonlinear interactions between shocks and state variables. The estimator is based on a doubly robust moment condition that identifies the average response function as a linear functional of a nonparametric conditional mean, augmented by a density ratio that captures the effect of shifting the shock of interest. We combine this moment condition with cross-fitting that handles serial dependence. The resulting estimator is $\sqrt{T}$-consistent and asymptotically normal. We examine the finite-sample performance of the estimator across a range of nonlinear data generating processes and illustrate its use in two empirical examples.

This paper provides a practical guide to estimating semiparametric and nonparametric fixed-effects panel data models using the mgcv package in R. The focus is implementation: handling fixed effects with unit indicators, first differencing, or penalized unit effects; specifying smooth terms; and conducting cluster-robust inference. Monte Carlo experiments compare \code{mgcv::bam} estimators with linear and fixed-series spline estimators. Simulations suggest that penalized splines adapt to unknown smoothness and estimate functions accurately in the designs studied here. A penalty-adjusted cluster-robust covariance estimator yields tests with near-nominal size for finite-dimensional parameters, and confidence bands provide accurate coverage for centered unknown functions.

We study strategic interaction when players delegate belief formation to predictive machine learning (ML). In a static Bayesian game, each player's ML agent predicts a payoff-relevant outcome variable as a function of the player's type. The ML agent's training sample is endogenous: it is drawn from the outcome distribution generated by players' ML-guided behavior. In Cross-Validation Equilibrium (CVE), each player's ML agent selects a predictive model to minimize expected out-of-sample squared error, given its realized training sample, and each player best-replies to the belief generated by the model her ML agent selected. We analyze CVE and relate it to other equilibrium concepts. We apply CVE to jury voting, speculative betting, and games with linear-quadratic payoffs. E.g., in a team-effort game, endogenous model selection can give rise to multiple equilibria.

We examine the continuity of equilibrium correspondences in infinite-dimensional settings where the commodity spaces are Banach lattices. Economies are modeled as Borel probability measures on a space of characteristics, with aggregate endowments defined via Bochner or Gel'fand integrals. Within this framework, we prove that the equilibrium correspondence is continuous on a dense subset of the domain of economies admitting equilibria, endowed with a suitable Polish topology. These results extend both classical and recent continuity theorems by providing a unified analytical treatment applicable to a substantially broader class of locally convex spaces and encompass models with infinite planning horizons, monopolistic competition, neoclassical economies, financial equilibria, and asymmetric information. Importantly, this study demonstrates that there is no necessity to impose differentiability assumptions that are typically required in regular economies to study equilibrium continuity.

Low-resolution data converters can significantly reduce the power consumption and silicon area of all-digital massive multi-user (MU) multiple-input multiple-output (MIMO) basestations. However, the existing literature almost exclusively focuses on idealistic quantization models, neglecting the inherent non-idealities present in real-world analog-to-digital converter (ADC) implementations. To overcome this limitation, we propose two affine models, one based on Bussgang's decomposition and one that maximizes the signal-to-distortion ratio (SDR), both accounting for the most prominent non-idealities in successive approximation register (SAR) ADCs. Subsequently, we utilize these models to devise low-complexity methods that mitigate SAR-ADC non-idealities in massive MU-MIMO wireless systems.

Affine frequency division multiplexing~(AFDM) has emerged as a compelling waveform candidate for future wireless networks, owing to its strong resilience to doubly selective channels and its ability to enable the seamless integration of communication and sensing functionalities. Against this context, this article provides a systematic study of AFDM from a standardization perspective. We first introduce the principles of AFDM and discuss the major considerations involved in waveform standardization. We then examine the backwards compatibility of AFDM with 4G/5G multi-numerology frameworks and their anticipated evolution, frequency-modulated continuous-wave (FMCW) radar waveforms, and long-range (LoRa) modulation, demonstrating that AFDM can be incorporated into legacy processing chains with limited modification. Key standardization-critical capabilities are further discussed, including multiple-antenna and multi-user support, and peak-to-average power ratio (PAPR). Finally, we investigate the potential of AFDM in several emerging scenarios, including non-terrestrial networks~(NTN), integrated sensing and communications (ISAC), vehicle-to-everything (V2X), and underwater acoustic (UWA) communications, whereby severe delay-Doppler dispersion places stringent demands on waveform robustness. Through these explorations, it is shown that that AFDM represents a timely and compelling technology for future wireless networks.

Practical implementations of phased arrays suffer from per-antenna gain, phase, and delay mismatches, which can significantly worsen the maximum sidelobe level (SLL) of beampatterns. The existing literature either analyzes specific structured mismatch patterns or derives per-angle marginal statistics under random mismatches, which fail to characterize global beampattern metrics such as the maximum SLL. To address this limitation, we propose a frequency-domain framework in which the beampattern is described by a tapering-window-dependent base function evaluated along a deformation determined by the array architecture and signal bandwidth. This formulation enables a spectral analysis of mismatches, revealing that element-wise errors generate weighted replicas of the ideal beampattern whose amplitudes are given by the discrete Fourier transform of the mismatch sequence. Building on this insight, we derive an approximation of the maximum SLL distribution under random gain and phase mismatches. The resulting expressions enable yield-oriented design and rapid design-space exploration without relying on computationally intensive Monte-Carlo simulations.

Chopper stabilized amplifiers are popularly used for realizing amplifiers with low offset and for rejecting flicker noise. One of the main limitations of these amplifiers is the low Input Impedance (Zin) produced by the switch capacitor input network. Zin here is resistive due to the switch capacitor action and is inversely proportional to the product of Chopping frequency (Fch) and Input Capacitance (Ci). Since Fch should be greater than the flicker noise corner frequency, this results in a low Zin. When interfacing sensors with high Sensor Output Impedance (Zo), chopper stabilized amplifiers load the sensors resulting in reduced sensitivity. This paper presents a novel input impedance boosting technique - Differential capacitor flipping technique for chopper based Capacitively Coupled Instrumentation Amplifier (CCIA), which prevents discharge and recharge of Ci's in every cycle by reconfiguring the capacitor positions while preserving the chopping operation. This ideally results in a purely capacitive Zin which is independent of Fch. The proposed architecture is used to demonstrate Electrocardiogram (ECG) signal acquisition with dry electrodes that have Zo in the order of a few Mega Ohms. This circuit implemented in TSMC 65 nm CMOS technology node features Zin of 21 GOhms at DC. The circuit has a power consumption of 2.6E(-6)W (2.8E(-6)W including clock generation circuits), with 7.2E(-6)Vrms (1 Hz-150 Hz) of total integrated input referred noise. ~

Variational autoencoder-based neural video coding has demonstrated impressive rate-distortion performance. However, its adoption in real-world applications remains hindered by challenges, such as prohibitively high computational complexity and limited cross-platform interoperability. These issues are often overlooked, as most neural video codecs rely on floating-point arithmetic to fully explore their rate-distortion potential. Practical deployment, however, requires integer-based implementations. Converting floating-point implementations into integer-based networks is non-trivial, since it involves quantizing inter-dependent coding components, whose sensitivity to precision may vary across codec designs. This paper introduces a Jointly-Optimized Mixed-Precision (JOMP) framework, in which both quantization parameters and bit widths are treated as learnable variables during training. This enables different codec modules to operate at varying precision levels, thereby jointly optimizing the rate-distortion-complexity trade-off. To the best of our knowledge, JOMP is the first mixed-precision quantization framework for neural video codecs. Its effectiveness is validated through a systematic investigation of quantization across different coding frameworks and temporal buffering strategies. Our study marks the first attempt to a unified understanding of the combined effects of modern coding frameworks and temporal buffering strategies, with the aim of informing future development of neural video codecs from a practicality perspective. In addition, we develop a complete integerization pipeline to achieve deterministic decoding. Overall, when applied to our best-performing model, JOMP enables end-to-end mixed-precision learning for integer neural video codecs, achieving rate-distortion performance comparable to that of the state-of-the-art DCVC-FM while reducing bit operations by 87.6%.

6G is expected to bring unprecedented advancements in the capabilities of vehicular networks. However, the advent of 6G will also introduce changes in the operation of vehicular communication infrastructures such as roadside units (RSUs), including the incorporation of autonomous intent-based network paradigm and integrated sensing and communication (ISAC) capabilities. While ISAC enables sensing and communication within a single 6G network node, intent-based network design paradigm ensures that network nodes such as RSUs, act as autonomous cognitive agents to fulfill the objectives of their respective communication service providers. This paradigm shift necessitates the development of V2I communication strategies that learns and adapts to the sensing-assisted communication and the autonomous decision-making strategies of RSUs. We model the RSU as a constrained utility maximizer, where the utility function characterizes the RSU intent, and formulate an inverse learning (IL) problem to infer the underlying utility function from observed ISAC RSU actions, for example the adaptive beamwidth allocation in response to the kinematic states of vehicles within a vehicular micro-cloud (VMC). The main contributions of this paper are: (i) ATIL, a nonparametric method based on Afriat theorem for fixed utility learning; (ii) FICNNIL, a parametric approach using fully input-concave neural networks, for structured fixed utility learning; and (iii) PICNNIL, a parametric approach based on partially input-concave neural networks, for inverse learning of state-dependent utilities. (iv) Federated inverse learning algorithms FedFICNNIL and FedPICNNIL for fixed and state dependent utility, respectively. We demonstrate the proposed IL-based framework for two V2I communication applications in VMCs, namely predictive scheduling for cooperative data downloading and dynamic cluster-head selection.

Scanning Photothermal Radiometry (SPR) is an active thermal technique that is simultaneously non-destructive, contactless, and allows for temporal resolutions on the order of nanoseconds, spatial resolutions down to the sub-micrometre scale and at different depths. This scanning method can be time consuming thus this work shows that it is possible to reduce the amount of measurements taken by 6 when using SPR on a sample consisting of carbon fibres in an aluminium matrix. It uses irregular sampling on sparse signals, and a weighted random technique to further decrease the amount of samples needed.

Gears are an integral component of electromechanical applications, but accurate condition monitoring methods, including data-driven predictive maintenance, are strongly dependent on high-quality data, especially from faulty components. To address the scarcity of data, we proposed a multibody simulation using an advanced polygonal contact method to replicate torsional vibrations from an experimental azimuth thruster test rig. The key novelty is the ability to simulate both healthy and faulty gears with arbitrary fault geometries. The simulated signals closely matched the measurements in both time and frequency domains. In the time domain, average torque levels and periodic fluctuations aligned well, although measured signals exhibited higher peak-to-peak amplitudes and greater noise, particularly in healthy conditions at lower rotational speeds. In the frequency domain, the simulations accurately reproduced expected fault frequencies and corresponding sidebands, with larger faults producing higher amplitudes. While the simulations tended to overestimate peak amplitudes and underestimate external noise, the results were highly comparable to measurements and consistent with the physical expectations. These findings provide a robust foundation for enhancing data-driven condition monitoring methods, particularly those employing machine learning or deep learning.

Driven by the massive video transmission requirements in the Internet of Everything, semantic communication holds great promise for striking a balance between transmission efficiency and quality. This paper introduces a large-model-driven generative video semantic communication (LGVSC) framework, enabling efficient video semantic transmission under extremely low bandwidth conditions. First, by decoupling the encoder and decoder as well as exposing explicit intermediate semantic representations, LGVSC maintains interpretability, avoiding the black-box behavior commonly observed in end-to-end systems. Next, we introduce a new metric, i.e., the probability-based semantic similarity score (PSSS), which quantifies semantic similarity for complex modalities within a continuous range, allowing for more precise evaluation of semantic content. Building on PSSS, we propose a semantic-guided keyframe extraction module driven by a multimodal large model. This module can enhance fine-grained semantic consistency during keyframe selection at the transmitter, optimizing transmission bandwidth without compromising semantic fidelity. Additionally, we design a generative large-model-driven dynamic semantic-adaptive decoder at the receiver, which can adapt to videos of arbitrary lengths. Simulation results demonstrate that LGVSC significantly outperforms traditional schemes, achieving a channel bandwidth ratio on the order of 10^-4 to 10^-3, while maintaining strong zero-shot generalization across downstream tasks.

In this paper, we propose leveraging rotatable antennas (RAs) to enhance near-field communication and sensing by exploiting a new orientation-domain spatial degree-of-freedom (DoF) provided by element-wise antenna rotation. Specifically, we investigate an RA-enabled near-field integrated sensing and communication (ISAC) system with sub-connected hybrid beamforming, where each transmit RA can independently adjust its boresight direction under a practical rotation constraint. A spherical-wave channel model incorporating orientation-dependent antenna gains is established to characterize multi-user communication and target sensing in the presence of clutters. Based on this model, a weighted communication-sensing utility maximization problem is formulated by jointly optimizing the receive beamformer, digital beamformer, analog beamformer, and RA boresight directions. To solve the resulting non-convex problem, an alternating optimization algorithm is developed by combining fractional programming, Riemannian optimization, and a spherical-cap Frank--Wolfe-based boresight update. To further understand the impact of RA rotation on near-field sensing, we derive a closed-form root Cramer--Rao bound (RCRB) expression. Simulation results demonstrate the convergence and effectiveness of the proposed algorithm. It is shown that the RA-enabled hybrid design can match or even outperform the fully-digital FPA benchmark in some regimes, indicating that the orientation-domain DoF introduced by element-wise rotation can compensate for limited RF chains. The RCRB and beampattern results further show that RA rotation improves off-broadside sensing accuracy, enhances range-domain focusing, and suppresses same-angle clutters in the near field.

Radio maps provide the essential foundation for low altitude networking systems. Unlike terrestrial radio maps that are typically generated via drive test measurements, mapping the air-ground environment requires the deployment of unmanned aerial vehicles (UAVs). This shift introduces two formidable challenges in uncharted 3D scenarios. First, sparse radio measurements and incomplete geometric observations hinder accurate reconstruction. Second, the large 3D action space and strict power constraints from high spectrum scanner energy consumption make informative exploration difficult. To address these issues, this paper proposes 3D uncertainty aware radio active mapping (3D-URAM), a closed loop active perception framework that decouples the mapping process into two offline trained stages. In Stage I, a Bayesian UNet is developed to recover radio maps from sparse measurements and partial geometry while providing calibrated predictive uncertainty. In Stage II, a dynamic probabilistic roadmap and a transformer based waypoint selection policy trained via proximal policy optimization maximize long horizon uncertainty reduction under travel budgets. Experimental results demonstrate that 3D-URAM reduces reconstruction error by over 50% compared to representative baselines. Real-world field tests within a 300mx200mx100m space also validate the potential of active radio map reconstruction.

This paper proposes a beamforming optimization scheme with joint antenna sub-array selection (SAS) and angular perturbation-based nulling (APN) for full-duplex (FD) massive multiple-input multiple-output (mMIMO) systems, to simultaneously suppress self-interference (SI) and multi-user interference (MUI). A comprehensive over-the-air SI channel measurement campaign, conducted with an 8x8Tx-8x8Rx FD array prototype, reveals significant variations across sub-arrays at different spatial locations, as well as reconfigurable characteristics of the SI channel under diverse Tx and Rx sub-array configurations. To exploit the selective SI channels, a particle swarm optimization (PSO)-based algorithm is developed to jointly determine optimal sub-array indices and perturbed steering angles, thereby effectively nullifying potential interference. Selecting sub-arrays with inherently lower SI channels notably enhances the beam-level isolation, while the added selection flexibility among comparable SI channels ensures more uniform SI suppression across diverse DL/UL locations and significantly improves worst-case isolation. Experimental evaluation based on the measured SI channel demonstrates that the proposed SAS technique achieves residual Tx-Rx beam-level SI suppression improvements of 29.2 dB and 26.6 dB for the sample 1x2 and 1x4 sub-arrays, respectively. A worst-case improvement greater than 30.7 dB is observed. Overall, the joint SAS and APN optimization scheme achieves average beam-level isolation of 85.2 dB and 83.3 dB with the 1x2 and 1x4 sub-arrays, respectively. With the application of a baseband precoder, all tested sub-array configurations achieve average MUI suppression better than -181.3 dB. These results confirm the potential of the proposed optimization algorithm to successfully reduce interference to the noise floor, thereby guaranteeing reliable FD mMIMO operation.

Affine frequency division multiplexing (AFDM) exhibits excellent Doppler robustness and the ability to characterize doubly selective channels. However, its signal dispersion characteristics make it challenging to directly adopt traditional time-frequency multiple access schemes. To address this issue, we introduce cooperative rate splitting multiple access (RSMA) for AFDM systems. The flexible configuration of AFDM chirp parameters can reduce the correlation between users' equivalent channels, which decreases the interference from RSMA private streams. We conduct a theoretical analysis of the cooperative RSMA-AFDM system and demonstrate that minimizing the overlap in the channel column spaces among users can effectively enhance the system performance. Guided by this analysis, we design a chirp parameter optimization scheme that reduces multi-user interference and maximizes diversity gain. To fully exploit the diversity gain brought by the proposed chirp parameter optimization, two expectation propagation (EP)-based distributed cooperative detection schemes are proposed. First, a decision-fusion-based method is developed, where local information and cooperative information are fused by maximum ratio combining, achieving a globally consistent estimate of the common stream. Second, we develop a belief-consensus EP-based detection scheme. In each iteration, user nodes exchange and fuse the first- and second-order statistics of the common stream, and the resulting beliefs gradually converge to a consistent global decision, which significantly improves the overall reliability.

This article proposes an improved rank based regression estimator obtained by replacing the ordinary integer ranks in the Wilcoxon rank-score regression procedure with smoothed ranks derived from a smoothed empirical cumulative distribution function. The smoothed ranks are computed via a continuous, nondecreasing kernel distribution function H that provides a differentiable approximation to the classical indicator function used in standard rank regression. Substituting these smoothed ranks into the Wilcoxon score function yields a new estimator for the slope parameter(s) of the simple and multiple linear regression model. We show that the proposed estimator inherits the robustness properties of classical rank regression while providing improved efficiency under heavy tailed error distributions and better handling of tied observations. A Wald type hypothesis test for the regression coefficients is derived and its asymptotic normality is established. A Monte Carlo simulation study compares new estimator with the ordinary least-squares (OLS) estimator, the classical Wilcoxon rank regression estimator, and the Theil and Sen estimator under several error distributions including the normal, Laplace, Cauchy, and contaminated normal. The proposed estimator achieves relative efficiencies at or above those of classical rank regression uniformly across all scenarios considered, with notable gains in the presence of outliers and heavy-tailed errors.

Small randomized controlled trials are often used to screen interventions before running larger follow-up studies. This is a critical phase of experimentation, as missing effective interventions or scaling up harmful ones can be very costly. A common proposal to mitigate these errors is to recruit samples that are representative of the target population, but this is often challenging in resource-constrained pilots. We challenge the narrative that representative samples are always superior by showing that when statistical significance testing determines whether interventions receive further study, the pilot trial composition that maximizes the downstream expected improvement in outcomes depends critically on its budget size. In the large-budget limit, the optimal pilot design converges to a sample that is representative of the target population. However, in the small-budget regime, the pilot designer maximizes expected impact by sampling only from a single homogeneous sub-population, chosen in a manner that depends on sampling costs and the designer's prior beliefs about heterogeneous treatment effects. Our proof of the small-budget result applies more generally when an RCT and significance test are used to decide whether to receive any non-adaptive downstream payoff, a result that may be applicable to other settings with constrained experimentation budgets.

In multi-class classification problems, classes often have a natural priority ordering (e.g., cancer stages, COVID-19 severity levels, or air-quality categories). In such settings, it is important to prioritize correct identification of more severe classes and to control under-classification errors, which occur when an observation from a higher-priority class is misclassified into a lower-priority one. The Hierarchical Neyman-Pearson (H-NP) framework of Wang et al. (2024) was developed for ordered multi-class settings to prioritize under-classification error control; its H-NP umbrella algorithm provides high-probability control of under-classification errors at user-specified levels. This paper introduces the R package HNPclassifier, which implements H-NP umbrella algorithms to construct H-NP classifiers using built-in learners such as logistic regression, random forests, and support vector machines, as well as user-supplied scoring functions, thereby enabling effective error control for ordered multi-class classification tasks.

We give a principled derivation of the Soft-Min-SNR weight of Crowson et al. (2024). The spread divergence of Zhang et al. (2018) convolves both compared distributions with a Gaussian kernel before taking the Kullback-Leibler (KL) divergence; applied to the per-sample local matched-Gaussian surrogate at each timestep, it yields the closed-form weight w(t,lambda) = sigma^2 / (sigma^2 + lambda). Three consequences follow. First, for variance-preserving schedules, w(t,lambda) equals a constant multiple of Soft-Min-SNR with gamma' = (1+lambda)/lambda, deriving a validated heuristic rather than introducing a new weight. Second, the same weight matches Min-SNR-gamma at leading order under gamma approximately 1/lambda, giving a cross-walk between the soft and hard reweighting families. Third, a local-geometry analysis scales an SGD-difficulty proxy by w^3 at high-SNR timesteps. Complementary to the objective-level account of Kingma & Gao (2023), who unified monotonic-in-log-SNR weightings as ELBOs of noise-augmented data, ours smooths both compared distributions rather than only the data side. Empirically, the matching rule holds on CIFAR-10 (linear and cosine) and CelebA-64 (cosine), with trajectory-wide confirmation on the cross-dataset cut: |Ours - Min-SNR| averages 0.45 FID across seven intermediate checkpoints on the seed-42 CelebA-64 trajectory, roughly 3x tighter than either reweighter's gap to DDPM. The local-geometry prediction is partially borne out: Ours converges about 21% earlier than DDPM at mid-training FID thresholds on CIFAR-10's linear schedule, where high-SNR damping headroom is largest, but this iteration-efficiency advantage does not transfer to cosine or CelebA-64, where all three methods reach similar final FIDs. Overall: final-FID parity with dataset-dependent iteration efficiency, plus a principled matching rule across the Min-SNR family.

The ongoing electrification and integration of renewable energy sources in Denmark's distribution grids pose significant operational challenges, including insufficient reserve capacity, component degradation due to overload, voltage instability, and increasing infrastructure investment requirements. This article argues that implicit demand-side flexibility (DSF) incentivized through dynamic tariffs offers the most scalable and cost-effective approach to address these challenges in a modern distribution network. We demonstrate that while explicit flexibility mechanisms provide operational certainty, they cannot scale to address system-wide congestion across heterogeneous customer bases. Drawing on empirical consumption data showing strong price-responsive behavior, varying prices due to, e.g., regulatory frameworks including the Danish Market Model 3.0 and Tariff Model 3.0, and economic analysis, we demonstrate potential grid savings of 13--48 million DKK per constrained substation through deferred or avoided reinforcement. We argue that implicit DSF mechanisms represent the necessary pathway for revenue-neutral scalable flexibility solutions that can defer costly grid reinforcements while maintaining system reliability. Beyond direct grid savings, additional value streams include avoided peak generation costs, reduced connection delays, and lower outage risk, further strengthening the economic case. Critically, dynamic tariffs offer the mechanism through which real-time grid constraints can be communicated to consumers, enabling price signals that accurately reflect the actual state of the capacity of the distribution network at any given point in time and space.

Using thematic maps to publish statistical information has become a popular visualization. As is the case with all statistical publications, thematic maps also have to deal with the balance between disclosure risk and utility. However, most risk and utility measures do not take into account the spatial character of a map. Some of the proposed spatial risk measures suffer from the Modifiable Areal Unit Problem (MAUP): slightly changing regional classifications may influence the risk. Indeed, even a small translation of for example a grid may influence that risk. We propose a new risk measure that does not suffer from MAUP. Moreover, our risk is directly related to the local density of the (target) population and takes into account that often multiple units may be connected to a single location. We show the behavior of our risk measure using an example dataset of fake but realistic locations of enterprises. Our risk measure can be adapted to take into account the effect on the (perceived) risk of zooming in or out and the effect of the used resolution.