A learning algorithm optimizes beamforming for holographic transceivers in far-field communication.
problem Optimal phase-shifts for beamforming in holographic transceivers are challenging due to unknown receiver locations and large phase-shifts.
method Developed a learning algorithm using a fixed-budget multi-armed bandit framework to learn optimal phase-shifts.
result The algorithm, HoloBeam, outperforms state-of-the-art methods in beamforming optimization.
PhaseDNN speeds up learning of high-dimensional functions across wide frequencies.
problem Training high-dimensional functions at wide frequencies is slow and inefficient.
method Parallel DNNs with frequency-specific training and phase shifts.
result PhaseDNN achieves uniform learning across wide frequencies.
Study on estimating signals from shifted and noisy copies in high dimensions, revealing a phase transition.
problem Estimating a signal in high-dimensional space from its circularly-shifted and noisy copies.
method Analysis of sample complexity in the high-dimensional regime, focusing on the parameter α.
result A phase transition phenomenon governed by α, with different sample complexities based on α values.
Analysis of ridge regression under concept shift reveals nontrivial effects on generalization performance.
problem Understanding and mitigating the impact of distribution shift in machine learning models.
method Derivation of exact prediction risk expression in the thermodynamic limit for ridge regression under concept shift.
result Reveals a phase transition and nonmonotonic data dependence of test performance under concept shift.
Analyzing large X-ray diffraction (XRD) datasets is a key step in high-throughput mapping of the compositional phase diagrams of combinatorial materials libraries. Optimizing and automating this task can help accelerate the process of discovery of materials with novel and desirable properties. Here, we report a new met…
A new model of V1 using orientation, frequency, and phase.
problem Understanding the complex behavior of V1 simple cells.
method Developed a sub-Riemannian model based on Gabor functions.
result The model enhances images using orientation, frequency, and phase.
Multi-task learning leverages shared information among data sets to improve the learning performance of individual tasks. The paper applies this framework for data where each task is a phase-shifted periodic time series. In particular, we develop a novel Bayesian nonparametric model capturing a mixture of Gaussian proc…
Study shows LIME's perturbation and labeling phases cause data and label shift, affecting model fidelity.
problem Data and label shift in LIME's explanation framework.
method Systematic evaluation of interpretable models trained on perturbed and labeled instances.
result Shift negatively correlates with model fidelity, necessitating a new sampling approach.
Algorithm learns from offline data to improve performance in target environment.
problem Learning from offline data in a target environment with unknown shifts.
method Adaptive algorithm that uses offline data to improve performance when informative.
result Algorithm provably improves performance over purely online learning when offline data are informative.
The paper analyzes how combining samples from two tasks can improve performance, especially in high dimensions.
problem Understanding when combining samples from two related tasks outperforms learning with one task alone.
method Applying random matrix theory to high-dimensional linear regression, focusing on proportional sample size increases.
result Precise high-dimensional asymptotics for bias and variance of HPS estimator, showing phase transitions in transfer performance.
DRCS selects a subset of data to minimize worst-case test error under covariate shift.
problem Selecting a subset of data that performs well across different deployment scenarios when data distributions differ.
method DRCS derives an upper bound for the worst-case test error assuming covariate shift and selects instances to minimize this bound.
result DRCS achieves distributionally robust training instance selection.
The intermarket analysis, in particular the lead-lag relationship, plays an important role within financial markets. Therefore a mathematical approach to be able to find interrelations between the price development of two different financial underlyings is developed in this paper. Computing the differences of the relat…
Develops a minimax optimal estimator for system stability under distribution shift.
problem Ensuring system reliability under changes in the underlying environment.
method Minimax optimal estimation of stability defined in terms of acceptable performance degradation.
result Characterizes the minimax convergence rate and demonstrates practical utility.
In Hamiltonian mechanics, a (continuous) symmetry leads to conserved quantity, which is a function on (extended) phase space. In Nambu mechanics, a straightforward consequence of symmetry is just a relative integral invariant, a differential form which only upon integration over a cycle provides a conserved real number…
Paper proposes an efficient method for calibrating spatio-temporal forecasts.
problem Real-world spatio-temporal forecasting challenges like signal anomalies and distributional shifts.
method Learning with Calibration (ST-TTC) for real-time bias correction.
result ST-TTC improves spatio-temporal forecasting accuracy with reduced computational cost.
New dataset for industrial machine malfunction detection with domain shifts.
problem Challenges in detecting anomalies due to domain shifts in industrial sounds.
method Created a dataset with domain shifts for five types of industrial machines.
result Significant performance differences between source and target domains.
This paper first answers the question "why do the two most powerful techniques Dropout and Batch Normalization (BN) often lead to a worse performance when they are combined together?" in both theoretical and statistical aspects. Theoretically, we find that Dropout would shift the variance of a specific neural unit when…
We study the convolutional phase retrieval problem, of recovering an unknown signal x∈Cn from m measurements consisting of the magnitude of its cyclic convolution with a given kernel a∈Cm. This model is motivated by applications such as channel estimation, optics, and u…
High frequency limit for most of wave phenomena is known as quasiclassical limit or ray optics limit. Propagation of waves in this limit is described in terms of wave fronts and rays. Wave front is a surface of constant phase whose points are moving along rays. As it appears, their motion can be described by Hamilton e…
Paper tackles moment estimation under covariate shift with a two-stage algorithm.
problem Estimating moments under covariate shift when source and target distributions differ.
method Proposes a two-stage algorithm: first, an optimal estimator for the source distribution; second, likelihood ratio reweighting for calibration.
result Achieves minimax optimal bound for moment estimation.
Framework detects shape shifts in functional profiles using Fréchet mean and shape invariant model.
problem Detecting shape shifts in functional profiles.
method Combining Fréchet mean and shape invariant model for interpretable parameterization of profile deviations.
result Potential shifts in shape deformation process distinguished by significant shifts in amplitude and/or phase.
Geometric observables detect financial regime shifts with high accuracy.
problem Detecting regime shifts in financial markets.
method Extracted four geometric observables from equity-index returns and evaluated them against various baseline methods.
result The Berry Phase Rate achieves an unbiased out-of-sample median Cohen's d of 0.72, significantly reducing false alarms.
Method selects features robust to concept shift using Shapley values.
problem Feature selection in static data does not work well with concept shifts.
method Establishes a direct relationship between Shapley values and prediction errors, detecting individual variable biases.
result Significantly outperforms state-of-the-art feature selection methods in concept shift scenarios.
Demand variance can result in a mismatch between planned supply and actual demand. Demand shaping strategies such as pricing can be used to shift elastic demand to reduce the imbalance. In this work, we propose to consider elastic demand in the forecasting phase. We present a method to reallocate the historical elastic…
Express Wavenet reduces neural network parameters to 1% of standard networks.
problem Optical neural networks with high parameter count.
method Wavelet modulation, random shift wavelets, expressway structure.
result Express Wavenet achieves high accuracy with significantly fewer parameters.
A new control chart detects shifts in binary data streams quickly and reliably.
problem Early detection of small shifts in multiple binary data streams.
method Cumulative Standardized Binomial EWMA (CSB-EWMA) chart with exact variance derivation.
result Adaptive control limits ensure robust detection across different data distributions.
New bounds for contrastive learning handle domain shifts and generalization.
problem Domain shifts and generalization challenges in downstream tasks.
method Novel generalization bounds accounting for both domain shift and generalization.
result Performance of contrastively learned representations depends on statistical discrepancy between pretraining and downstream distributions.
Reward hacking exploits misspecified rewards, affecting agent capabilities and true performance.
problem Reward hacking in RL models exploiting reward misspecifications.
method Constructed four RL environments with misspecified rewards; analyzed agent capabilities and behavior.
result More capable agents exploit reward misspecifications, achieving higher proxy reward but lower true reward.
The paper analyzes how noise affects distances in high-dimensional data and when they remain useful.
problem Noise corrupts distances in high-dimensional data, making them unreliable for identifying true nearest and farthest neighbors.
method The paper uses asymptotic probabilistic expressions to characterize noise effects and decomposes data into ground truth and noise components.
result Under certain conditions, empirical neighborhood relations remain truthful even when distance concentration occurs.
Safe-DRFS selects features robust to covariate shifts for reliable performance.
problem Feature selection fails in diverse deployment environments.
method Safe-DRFS extends safe screening to distributionally robust settings under covariate shift.
result Safe-DRFS identifies a feature subset encompassing optimal subsets across distribution shifts.
MLE works best for covariate shift without modifications.
problem OOD generalization under covariate shift.
method Maximum Likelihood Estimation (MLE) without modifications.
result MLE achieves minimax optimality for covariate shift under well-specified setting.
AlphaMLDigger predicts excess returns in fluctuating markets.
problem Mining effective information for investment decisions in a volatile market.
method Two-phase approach using deep NLP for sentiment analysis and ensemble ML models.
result Ensemble models achieve 0.984 accuracy, significantly outperforming baseline.
Statistical mechanics reveals phase transitions in ε-SVR error.
problem Understanding task precision in neural representations with variability.
method Statistical mechanics applied to ε-SVR. result Double-descent phenomenon in generalization error due to ε. This study analyzes VAEs using ID and II, revealing a transition in behaviour and distinct training phases.
problem Understanding the hidden representations and training phases of VAEs.
method Analysis using Intrinsic Dimension (ID) and Information Imbalance (II).
result VAEs exhibit a transition in behaviour and distinct training phases when the bottleneck size exceeds the Intrinsic Dimension of the data.
MetaCI uses meta-learning to generalize causal inference across heterogeneous populations.
problem Generalizing causal inference from multiple homogeneous subgroups to a heterogeneous population.
method MetaCI employs meta-learning to handle data distribution shifts and concept drifts.
result MetaCI outperforms random initialization and other methods in counterfactual inference.
This paper recovers smooth functions from noisy modulo samples using a three-stage strategy.
problem Recovering Hölder smooth functions from noisy modulo samples.
method Three-stage strategy: denoising with local polynomial estimators, unwrapping, and spline-based quasi-interpolant.
result Uniform error rates for Hölder class functions with high probability.
Spiking neural networks enable efficient approximate Bayesian inference via permanent dropout.
problem Efficient uncertainty quantification in neural network predictions for critical tasks.
method Conversion of classical neural networks to spiking neural networks, applying permanent dropout for inference.
result Predictive distributions from spiking neural networks using permanent dropout are nearly identical to those from classical networks.
New algorithm identifies best arm in semiparametric bandits with near optimal efficiency.
problem Fixed-confidence Best Arm Identification in semiparametric bandits with unknown baseline shift.
method Phase-elimination algorithm based on orthogonalized regression design.
result Nearly optimal high-probability sample-complexity upper bound established.
Adversarial weighting improves regression task adaptation.
problem Improving regression performance across domains with covariate shift.
method Adversarial network algorithm for instance weighting and task learning.
result The method enhances regression accuracy on target domains.
We find optimal learning rate schedules for a random feature model.
problem Choosing optimal learning rates for deep learning models.
method We analyze a powerlaw random feature model trained with SGD, considering optimal schedules as numerical and analytical problems.
result We discover two regimes: easy and hard phases, with different optimal learning rate schedules.
Adaptive algorithm identifies best arm with abstention, showing phase transition from polynomial to exponential error probability.
problem Bayesian best-arm identification with abstention to reduce undetected error.
method Adaptive algorithm PGWS that optimally uses abstention budget.
result Introducing any positive abstention budget induces an exponential decay in undetected error probability.
We analyse four consecutive cycles observed in the USA for employment and inflation. They are driven by three oil price shocks and an intended interest rate shock. Non-linear coupling between the rate equations for consumer products as prey and consumers as predators provides the required instability, but its natural d…
The goal of this investigation was to overcome limitations of a persistency analysis, introduced by Benoit Mandelbrot for fractal Brownian processes: nondifferentiability, Brownian nature of process and a linear memory measure. We have extended a sense of a Hurst factor by consideration of a phase diffusion power law. …
Study shows overparametrization can shift and bend loss landscapes, affecting signal recovery.
problem Understanding how overparametrization affects loss landscapes in neural networks.
method Field theory analysis of Hessian spectrum at initialization.
result Overparametrization can shift the BBP transition point, potentially reaching weak-recovery threshold.
Improves VQAs by balancing classical and quantum training resources.
problem Challenges in trainability and resource costs of VQAs on quantum hardware.
method Adopting HELIA Ansatz and combining classical and quantum methods for gradient estimation and training.
result Achieves higher accuracy and success rates in VQE and improved test accuracy in quantum phase classification.
Paper addresses quantization bias in neural networks, proposing a simple method to improve performance.
problem Quantization bias causes performance degradation in low-precision neural networks.
method Compensating for quantization-induced shift by adding a constant to the bias term.
result Simple methods for estimating correction constants can match training-based quantization performance at lower cost.
Simple policy search outperforms advanced learnable test-time augmentation techniques.
problem Improving predictive performance through test-time data augmentation.
method Greedy policy search (GPS) for learning test-time augmentation policies.
result Augmentation policies learned with GPS achieve superior predictive performance and robustness.
Dynamic Influence Tracker measures changing sample importance during model training.
problem Static influence measurements during training overlook how sample importance varies over time.
method Dynamic Influence Tracker (DIT) captures time-varying sample influence across arbitrary time windows.
result DIT reveals distinct learning phases with shifting priorities and detects corrupted samples more efficiently.