Test the robustness of quantum-enhanced phase estimation under various noise conditions.
problem Evaluate the robustness of quantum-enhanced adaptive phase estimation (QEAPE) in noisy conditions.
method Simulated QEAPE under four phase-noise models and compared resource usage of evolutionary and Bayesian control policies.
result Demonstrated the effectiveness of both evolutionary and Bayesian control policies in noisy conditions.
Proposes a new framework for evaluating diagnostic models with multiple co-primary endpoints.
problem Overoptimistic assessments of predictive performance in automated medical testing devices.
method Multiple testing framework for diagnostic accuracy studies with co-primary endpoints, using a parametric simultaneous test procedure and Bayesian approach to determine optimal number of models.
result Our approach leads to a better final diagnostic model and increased statistical power.
The paper introduces a method to eliminate latent discrimination in predictive models.
problem Controlling for latent discrimination in predictive models.
method Defining a new fairness criterion inspired by omitted variable bias, and a training strategy that includes sensitive features during training and excludes them during testing.
result A simple yet effective strategy to eliminate latent discrimination in predictive models.
In several realistic situations, an interactive learning agent can practice and refine its strategy before going on to be evaluated. For instance, consider a student preparing for a series of tests. She would typically take a few practice tests to know which areas she needs to improve upon. Based of the scores she obta…
GTBO uses group testing to optimize high-dimensional functions efficiently.
problem Challenges in optimizing high-dimensional, expensive functions due to the curse of dimensionality.
method GTBO combines testing and optimization phases to identify active variables and guide efficient optimization.
result GTBO outperforms state-of-the-art methods on high-dimensional optimization tasks.
Classification and regression tasks in overparameterized models show different generalization properties.
problem Comparing classification and regression in overparameterized models.
method Comparison of least-squares minimum-norm interpolation and hard-margin SVM using different loss functions.
result Interpolating solutions generalize well with 0-1 loss but not with square loss.
Estimates vaccine effectiveness and immune correlates in TND studies with missing data.
problem Confounding and missing data in TND studies of vaccine effectiveness and immune correlates.
method Targeted maximum likelihood estimation using a semiparametric logistic regression model.
result Valid causal inference of vaccine effectiveness and immune correlates in TND studies with missing exposure data.
An algorithmic limit of compressed sensing or related variable-selection problems is analytically evaluated when a design matrix is given by an overcomplete random matrix. The replica method from statistical mechanics is employed to derive the result. The analysis is conducted through evaluation of the entropy, an expo…
GTBO uses group testing to optimize high-dimensional functions efficiently.
problem Optimizing expensive, high-dimensional functions with limited data.
method Group testing to identify active dimensions, then guide optimization.
result GTBO outperforms state-of-the-art methods on high-dimensional benchmarks.
Gonogo offers tools for sensitivity experiments in R.
problem Conducting, analyzing, and simulating sensitivity experiments.
method Suite of R functions for various adaptive procedures.
result Achieving overlapping data and refining testing in distribution tails.
Paper optimizes hypothesis verification in sequential experiments.
problem Maximizing confidence in a verified hypothesis after exploration.
method Formulated as a confidence maximization problem in a POMDP, characterized optimal solutions, and proposed a heuristic.
result Heuristic performs better than existing methods in some scenarios.
A new metric, Weighted Regret, unifies FDR and power evaluation in online multiple testing.
problem The asymmetric costs of false positives and false negatives in automated pipelines.
method Introducing Weighted Regret and Decoupled-OMT (DOMT) to unify FDR and power evaluation.
result DOMT achieves an order-optimal sublinear mitigation of threshold depletion in bursty environments.
Study phase transitions in identifying infected individuals using group testing.
problem Identifying a set of k infected individuals from a population using pooled tests.
method Two random assignment designs (constant-column and Bernoulli) and polynomial-time inference procedures.
result Sharp phase transitions in statistical and computational limits for detection and recovery problems.
This research explores the effects of various training settings from Polish to English Statistical Machine Translation system for spoken language. Various elements of the TED parallel text corpora for the IWSLT 2013 evaluation campaign were used as the basis for training of language models, and for development, tuning …
This paper resolves Breiman's dilemma in neural networks by analyzing phase transitions of margin dynamics.
problem Breiman's dilemma in neural networks: uniform margin improvement does not guarantee reduced generalization errors.
method Revisiting Breiman's dilemma in deep neural networks with spectrally normalized margins, analyzing phase transitions of normalized margin distributions.
result Margin-based generalization bounds can predict test error trends during training phase transitions.
Researchers compute and predict knot volumes using colored Jones polynomials.
problem Computing and predicting volumes of hyperbolic knots.
method Vertex model approach, neural network training, polynomial evaluations.
result 3-colored Jones polynomials predict knot volumes with high accuracy.
A new test optimizes detecting small communities in large networks.
problem Detecting small communities in large networks.
method Using Sinkhorn's theorem and a degree-corrected block model (DCBM), the study optimizes the SgnQ test for this challenging setting.
result The SgnQ test is optimal for detecting communities larger than √n, achieving the computational lower bound (CLB).
Paper proposes a new evaluation method for NAS search phase.
problem NAS search phase effectiveness not well evaluated.
method Compare NAS solutions with random selection; evaluate weight sharing strategy.
result State-of-the-art NAS algorithms perform similarly to random selection.
We consider models of financial markets in which all parties involved find incentives to participate. Strategies are evaluated directly by their virtual wealths. By tuning the price sensitivity and market impact, a phase diagram with several attractor behaviors resembling those of real markets emerge, reflecting the ro…
Paper uses VAEs to measure distance between high-dimensional datasets.
problem Measuring the similarity or difference between high-dimensional datasets.
method Variational Autoencoders (VAEs) for distance measurement, permutation hypothesis test for significance.
result The proposed approach can quantify the discrepancy between datasets.
High-dimensional U-statistics show surprising phase transitions, impacting kernel-based tests.
problem Understanding phase transitions in high-dimensional U-statistics.
method Proved a convergence theorem for U-statistics of degree two in high dimensions.
result High-dimensional U-statistics can have non-Gaussian limits with larger variance and asymmetry.
Lowered regularity assumption for a phase-dependent Helfrich energy equation.
problem Analyzing the phase separation line of the Helfrich energy.
method Used a carefully chosen test function with a signed distance function.
result Regularity assumption lowered from C2 to C1,1 for the phase separation line. The paper analyzes convergence in SGD with momentum and proposes a diagnostic test.
problem Detecting convergence in stochastic gradient descent with momentum.
method Analyzes the transient and stationary phases of SGD with momentum, constructs a statistical diagnostic test.
result The proposed diagnostic test effectively detects convergence in the stationary phase of SGD with momentum.
Characterizes RFF regression in large n,p,N setting, providing precise learning phases and double descent curve.
problem Characterizes RFF regression in large n,p,N setting. method Characterizes the exact asymptotics of random Fourier feature (RFF) regression in the realistic setting of large n,p,N. result Characterizes two qualitatively different phases of learning and the corresponding double descent test error curve.
Paper proposes a new method to detect convergence in SGD.
problem Detecting the transition from fast progress to oscillation in SGD.
method Analyzes Pflug's test and proposes a novel statistical procedure.
result The novel procedure accurately detects stationarity in SGD.
LM-SNNs use lattice maps to classify and cluster images.
problem Image classification and clustering.
method Lattice map spiking neural networks with cooperative and competitive interactions, inhibition strategies, and biologically motivated learning rules.
result LM-SNNs effectively classify and cluster images using self-organized filters.
FL's early training phase significantly impacts final test accuracy.
problem Understanding how early phases affect FL's final test accuracy.
method Generalized Fisher Information Matrix (FedFIM) to FL.
result FL exhibits critical learning periods where small errors can have large impacts.
Paper shows softmax output misleads in evaluating adversarial example strength.
problem Softmax output misleads in evaluating adversarial example strength.
method Demonstrates how adversarial examples can exploit softmax properties.
result Softmax output is a poor indicator of adversarial example strength.
The problem of optimizing unknown costly-to-evaluate functions has been studied for a long time in the context of Bayesian Optimization. Algorithms in this field aim to find the optimizer of the function by asking only a few function evaluations at locations carefully selected based on a posterior model. In this paper,…
A study on optimizing data augmentation weights for improved test-time predictions.
problem Improving robustness of predictions during testing with data augmentation methods.
method A weighted Test-Time Augmentation (TTA) approach based on variational Bayesian framework to optimize weights.
result Optimizing weights suppresses unwanted data augmentations and improves prediction performance.
Synthetic control method improves policy evaluation in high-dimensional settings.
problem Evaluating the impact of new policies in large-scale applications.
method Two-phase approach: nearest neighbor matching followed by supervised learning.
result The method successfully improves estimate accuracy in large-scale experiments.
Develops a statistical test for IV, improving feature selection reliability.
problem Lack of statistical justification in conventional IV-based feature selection.
method Establishes connection with Jeffreys divergence and proposes a nonparametric hypothesis test.
result The J-Divergence test provides rigorous guarantees and is more reliable than traditional IV thresholds.
Paper proposes a novel approach for stock prediction using NLP and Japanese candlesticks.
problem Challenging task of predicting stock trends due to multiple influencing factors.
method Combines NLP and Japanese candlesticks, creating a language from OHLC data, training Word2Vec model, and predicting trading actions.
result Word2Vec outperformed other models in various scenarios, achieving positive results.
This paper presents a comparison of six machine learning (ML) algorithms: GRU-SVM (Agarap, 2017), Linear Regression, Multilayer Perceptron (MLP), Nearest Neighbor (NN) search, Softmax Regression, and Support Vector Machine (SVM) on the Wisconsin Diagnostic Breast Cancer (WDBC) dataset (Wolberg, Street, & Mangasarian, 1…
A tensor model for meta-learning adapts to task-specific features.
problem Learning shared representations for diverse tasks without task-specific observable information.
method Modeling meta-parameters as an order-3 tensor, estimating through tensor regression and method of moments.
result Tensor-based approach improves meta-learning performance with fewer samples.
Financial Times Series such as stock price and exchange rates are, often, non-linear and non-stationary. Use of decomposition models has been found to improve the accuracy of predictive models. The paper proposes a hybrid approach integrating the advantages of both decomposition model (namely, Maximal Overlap Discrete …
AI agents learn to cooperate with users of unknown type.
problem Designing AI agents that can cooperate with new users effectively.
method Modeling user behavior as parameters, observing user actions to infer type, and adapting policies.
result Adaptive AI agents perform significantly better than non-adaptive ones in real scenarios.
This study evaluates a dynamic pairs trading strategy in cryptocurrencies using cointegration tests.
problem Improving profitability and risk management in cryptocurrency trading.
method Engle-Granger, KSS, Johansen tests; optimal look-back window; mean-reversion speed calibration; microstructure limitations consideration.
result The strategy outperforms naive buy-and-hold in Bitmex exchange with low maximum drawdown.
Study shows reverberant phase is not essential for weakly-supervised dereverberation.
problem Evaluating the role of reverberant phase in weakly-supervised dereverberation.
method Statistical Wave Field Theory and recent weak supervision framework.
result Wet phase carries limited useful information and is not essential for weakly supervised dereverberation.
This research examines how the error rate of nearest neighbor classifiers varies with dataset size.
problem The scaling of classification error rates with dataset size is not uniform.
method Theoretical analysis of nearest neighbor classifiers, focusing on early and late phases of dataset size.
result The error rate of nearest neighbor classifiers can have fine-grained rates depending on the dataset size and data distribution.
Gradient descent dynamics in quadratic regression models are analyzed, revealing five phases: monotonic, catapult, periodic, chaotic, and divergent.
problem Analyzing the dynamics of gradient descent in quadratic regression models.
method Fine-grained bifurcation analysis of gradient descent dynamics using a cubic map parameterized by the step-size.
result Gradient descent dynamics in quadratic regression models exhibit five distinct phases: monotonic, catapult, periodic, chaotic, and divergent.
Proposes using GANs to solve phase retrieval problems.
problem Solving phase retrieval problems in various contexts.
method Applying conditional GANs with knowledge of measurement process.
result Method provides more robust and detailed solutions.
Advanced deep learning model improves speech enhancement by estimating phase accurately.
problem Difficulty in estimating the phase of clean speech in speech enhancement.
method Proposes Deep Complex U-Net, polar coordinate-wise complex-valued masking, and wSDR loss function.
result Achieves state-of-the-art performance in all metrics, outperforming previous approaches.
This paper shows how learning the phase-amplitude coupling improves bio-signal classification.
problem Discarding phase component in bio-signal feature extraction leads to poor generalization.
method Introducing a novel self-supervised learning task called Phase-Swap to detect phase-amplitude coupling.
result Neural networks trained on Phase-Swap task generalize better across subjects and recording sessions.
This paper proposes a new AED framework for multi-metric experiments with fixed budget.
problem Statistical power challenges in testing multiple metrics simultaneously.
method Two-phase structure: adaptive exploration followed by validation. SHRVar algorithm with relative-variance-based sampling.
result Achieves provable error probability that decreases exponentially.
Deep networks learn features suddenly, akin to a phase transition.
problem Understanding sudden feature learning in deep networks.
method Adaptive kernel approach applied to two teacher-student models.
result Feature learning and Grokking are analogous to a first-order phase transition.
In this paper, we study the pooled data problem of identifying the labels associated with a large collection of items, based on a sequence of pooled tests revealing the counts of each label within the pool. In the noiseless setting, we identify an exact asymptotic threshold on the required number of tests with optimal …
Study shows it's impossible to count communities without finding them.
problem Determining the number and sizes of communities in random graph models.
method Hypothesis testing between models with different community structures, using low-degree polynomial framework.
result Testing between two different planted distributions is as hard as finding the communities.