Paper improves phase identification in power systems using information theory.
problem Improving supervised learning accuracy in phase identification.
method Developed two new techniques based on information theory.
result Significant improvement in phase identification accuracy (e.g., from 51.7% to 97.3%).
Study optimizes best-arm identification with minimax and Bayes strategies.
problem Efficiently identifying the best arm in fixed-budget scenarios.
method Adaptive procedure with two stages: pilot phase and minimax game.
result Single strategy is asymptotically minimax and Bayes optimal.
A new method identifies phase connections in smart grids using PCA and graph theory.
problem Keeping track of consumer phase connections in smart grids.
method Data-driven approach using PCA and graph theory.
result Algorithm infers phase connectivity from noisy smart meter data.
New method for identifying phase shifts in XRD data.
problem Automating phase extraction from large XRD datasets.
method Nonnegative Matrix Factorization integrated with custom clustering.
result Robust determination of phase shifts and accurate phase diagrams.
Data-driven approach learns effective equations for phase field interfaces.
problem Learning accurate equations for phase field interface dynamics.
method Data-driven identification of partial differential equations from phase field data.
result Data-driven equations outperform analytical approximations in certain regimes.
A two-phase algorithm identifies the best arm in sparse linear bandits with fixed budget.
problem Best arm identification in sparse linear bandits with limited budget.
method Lasso and Optimal-Design (Lasso-OD) based linear best-arm identification.
result Lasso-OD achieves significant performance improvement for sparse and high-dimensional linear bandits.
Paper uses smart meter data to accurately estimate multi-phase topology and identify bus phases in unbalanced distribution grids.
problem Accurate topology knowledge is needed for monitoring and controlling uncertainties in unbalanced distribution grids.
method Converts multi-phase unbalanced systems into symmetrical components and uses information theory, power flow equations, and conditional independence relationships to estimate topology and identify bus phases.
result The algorithm accurately estimates multi-phase topology and identifies bus phases in unbalanced distribution grids, even with strong load unbalancing and DERs.
Paper tackles best arm identification with cost consideration.
problem Best arm identification with cost consideration in product development.
method Derives a theoretical lower bound and proposes algorithms CTAS and CO.
result Simple algorithms can deliver near-optimal performance.
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.
New method for identifying nearly-optimal arms in bandit models with fixed confidence.
problem Near-optimal arm identification in infinitely armed bandit models with limited prior knowledge.
method PAC-like framework, sample complexity lower bound, algorithm with upper bound on sample complexity.
result Proposed algorithm identifies nearly-optimal arm with high probability and within log factor of lower bound.
IIC decouples causal identification into two phases, significantly reducing the HTC gap in linear SEMs.
problem Determining causal effect coefficients in linear SEMs with latent confounders using the Half-Trek Criterion (HTC) leaves a gap of inconclusive causal effects.
method Iterative Identification Closure (IIC) framework that decouples causal identification into two phases: a seed function S_0 and Reduced HTC propagation.
result IIC strictly subsumes both HTC and ancestor decomposition, reducing the HTC gap by over 80% with combined seeds.
Machine learning identifies phase transitions in condensed matter physics.
problem Classifying phase transitions in condensed matter physics.
method Unsupervised and supervised machine learning techniques applied to the Ising model.
result Machine learning can detect multiple phases and regions within the paramagnetic phase.
PROBE optimizes best-arm identification with cheap proxies, improving sample complexity.
problem Fixed-confidence best-arm identification with costly rewards and correlated cheap proxies.
method PROBE uses control-variate adjustment and phase elimination to learn residual variance online.
result PROBE achieves oracle sample complexity up to a constant factor and additive calibration cost.
Paper extends cepstral distance for stable, minimum-phase models.
problem Quantifying similarity between data objects in deterministic systems.
method Combines insights from systems theory and machine learning to extend weighted cepstral distance.
result Extended weighted cepstral distance can be interpreted in terms of poles and zeros of the model.
Study uses supervised learning to classify quantum phases with limited measurements.
problem Classifying quantum phases of matter with incomplete phase diagrams.
method Combines classical and quantum techniques, including tensor networks, kernel methods, and quantum algorithms.
result Certification of new ground states can be achieved with polynomial measurements.
Polynomial-time algorithm learns latent-state systems without spectral radius assumptions.
problem Learning latent-state linear dynamical systems without spectral radius assumptions.
method Spectral filtering technique with a novel convex relaxation.
result Efficient identification of phases for general transition matrices.
Consistent partial identification of causal effects proved for neural models.
problem Consistency of neural causal partial identification methods.
method Proving consistency for neural models with continuous and categorical variables, considering architecture design and Lipschitz regularization.
result Proven consistency of partial identification via neural causal models in a general setting.
A new algorithm for identifying the best arm in linear feedback with safety constraints.
problem Identifying the best arm in linear feedback with safety constraints.
method A gap-based algorithm that ensures safety while minimizing sample complexity.
result The algorithm achieves meaningful sample complexity while ensuring safety.
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.
A new geometric approach to identify slow invariant manifolds in complex systems.
problem The mathematical definition of slow invariant manifolds is unsatisfactory and limited to slow-fast systems.
method Formulate slow invariant manifolds geometrically within the context of differential geometry, focusing on covariant formulations.
result A more general definition of slow invariant manifolds is provided, independent of coordinate choice.
Algorithm identifies the best arm in linear bandits with high probability.
problem Best arm identification in linear multi-armed bandits with noisy measurements.
method Phased Elimination Linear Exploration Game (PELEG) using no-regret learners.
result PELEG achieves sample complexity matching lower bounds.
End-to-end algorithm for controlling bilinear systems with probabilistic noise.
problem Controlling bilinear systems with noisy data.
method Proposes an end-to-end algorithm using statistical learning theory and robust controller design.
result Derived finite sample identification error bounds and structurally suitable for control.
Study uses Thompson Sampling to find optimal drug dosages in clinical trials.
problem Finding the best drug dosage in early-stage clinical trials.
method Adopted Thompson Sampling for dose-finding clinical trials, considering different monotonicity assumptions.
result Thompson Sampling variants outperform existing methods in various dose-finding scenarios.
Paper proposes M2H-GAN to improve speech theme identification.
problem Limited ASR transcripts for speech theme identification.
method Uses M2H-GAN, a GAN-based approach, to generate TRS-like ASR transcripts.
result Improves speech theme identification performance close to human levels.
Study on identifying labels in pooled tests with noise and errors.
problem Identifying labels in pooled tests with noise and errors.
method Exact asymptotic threshold and information-theoretic framework for noisy and noisy-noise models.
result Noise can significantly increase the difficulty of the problem, even at low levels.
We describe a bottom-up framework, based on the identification of appropriate order parameters and determination of phase diagrams, for understanding progressively refined agent-based models and simulations of financial markets. We illustrate this framework by starting with a deterministic toy model, whereby N indepe…
New algorithm tackles nonstationary linear bandits with latent dynamics.
problem Nonstationary bandit problem with latent states and unknown dynamics.
method Explore-then-commit algorithm with exploration and commitment phases.
result Achieves ildeO(T2/3) regret. Machine learning identifies chimera states in complex dynamical systems.
problem Chimera states are hard to identify due to their varied appearance and peculiar nature.
method Machine learning techniques, specifically random forest and oblique random forest with null space regularization.
result High accuracy in identifying chimera states across different dynamical models.
Deep learning identifies smartphone users from motion sensor data.
problem Smartphone user identification using motion sensor signals.
method Transformed motion signals into images, trained CNN for classification, used SVM for few-shot identification.
result CNN achieved 89.75% multi-class user classification and 96.72% few-shot user identification accuracy.
New approach uses synthetic labels to train models on scarce annotated data for surgical phase recognition.
problem Learning surgical phase recognition from limited annotated data.
method Teacher/Student approach with a CNN-biLSTM-CRF teacher generating synthetic labels for a CNN-LSTM student.
result Improved surgical phase recognition performance with fewer annotated videos.
Deep object detection improves mitotic nucleus detection in breast cancer biopsies.
problem Challenges in automated mitotic nucleus detection in breast cancer histopathological images.
method Adapted Mask R-CNN for deep object detection, initially selects candidate regions with maximum recall, refines them with multi-object loss function.
result Improved discrimination ability (F-score of 0.86) and significant precision (0.86) for mitotic nuclei compared to two-stage models.
New method identifies common cause in causal insufficiency, revealing complex phase transitions.
problem Identifying common cause in causal insufficiency with observed joint probability.
method Generalized maximum likelihood method, closely related to maximum entropy principle.
result Identifies consistent common cause that aligns with the common cause principle.
Efficient algorithms for low-rank bandits using subspace recovery.
problem Contextual bandits with low-rank reward matrices.
method Spectral methods for subspace recovery, reformulating as linear bandits.
result Nearly optimal policy evaluation and best policy identification, minimax guarantees for regret minimization.
We identify and approximate weights of two-layer neural networks from few samples.
problem Identifying and approximating weights of two-layer neural networks from limited data.
method Active sampling of finite difference approximations to Hessians, solving robust nonlinear programs, and gradient descent.
result Stable recovery of network weights under verifiable conditions.
Breath sounds can identify speakers with high accuracy.
problem Identifying speakers from breath sounds.
method Examined breath sounds during continuous speech, focusing on inhalation phase.
result Breath sounds carry unique speaker-specific information, enabling accurate speaker identification.
Enhanced feature extraction pipeline boosts music genre recognition.
problem Improving music genre classification accuracy.
method Extended feature engineering pipeline with multiple stages and feedback loops.
result The method significantly improves classification performance on the GTZAN dataset.
BRACE addresses noncompliance in bandits, offering methods for recommendation and treatment policies.
problem Noncompliance in bandit problems complicates learning objectives and treatment effects.
method BRACE formalizes objective-choice, identifies direct-control regimes, and proposes a phase-doubling algorithm for IV inversion.
result BRACE delivers valid policy values and structural uncertainty, even under weak identification and homogeneity failure.
Bayesian method identifies dynamical models with uncertainty quantification.
problem Uncertainty in selecting governing equations for dynamical systems.
method Bayesian sparse identification with model averaging.
result Accurately recovers sparse interaction structures with uncertainty quantification.
This work proposes a geometric approach to identify slow invariant manifolds in dynamical systems.
problem Identifying slow invariant manifolds in multiple time-scale dynamical systems.
method Differential geometric concepts for submanifolds, sectional curvature, flow invariance.
result Necessary condition for slow invariant manifold invariance stated in terms of differential geometry.
Bayesian method assesses structural damage using sparse learning and Gibbs sampling.
problem Detecting spatially-sparse stiffness reductions in structures.
method Hierarchical sparse Bayesian learning, Gibbs sampling, incomplete modal data.
result Effective detection of spatially-sparse stiffness reductions in structures.
Speech enhancement improved by adapting to unknown speakers without auxiliary signals.
problem Improving speech enhancement accuracy for unknown speakers.
method Adopting multi-task learning for speech enhancement and speaker identification, using multi-head self-attention.
result Achieved state-of-the-art performance and improved subjective quality.
Proposes MD-LiNA for multi-domain latent factor causal discovery.
problem Discovering causal structures among latent factors from multi-domain data.
method Multi-Domain Linear Non-Gaussian Acyclic Models (MD-LiNA) with an integrated two-phase algorithm.
result Locally consistent estimators of causal structure among shared latent factors.
New method balances performance and cost in identifying best arm.
problem Identifying the best arm in multi-armed bandit models.
method Minimizes a risk functional that balances performance and cost.
result Proposes DBCARE algorithm that matches theoretical lower bounds.
CoCAI uses copulas for accurate multivariate time-series forecasting and anomaly detection.
problem Accurate multivariate time-series forecasting and robust anomaly detection.
method Copula-based conformal prediction for multivariate time-series analysis.
result CoCAI provides statistically valid predictive regions and robust anomaly scores.
Firm foundation theory estimates a security's firm fundamental value based on four determinants: expected growth rate, expected dividend payout, the market interest rate and the degree of risk. In contrast, other views of decision-making in the stock market, using alternatives such as human psychology and behavior, bou…
New method detects anomalies and signals in complex, unlabeled data.
problem Detecting anomalies and signals in complex, unlabeled data with hidden nonlinear dynamics.
method Unsupervised machine learning in a Koopman operator function space.
result Significantly improved anomaly detection and signal identification.
DEMUD-VIS detects novel image content and explains it visually.
problem Detecting and explaining novel image content in large datasets.
method Uses CNN for feature extraction, reconstruction error for novelty detection, and up-convolutional networks for image reconstruction.
result Demonstrates visual explanations of novel image content on diverse datasets.
Proposes a novel MTL approach based on bias-variance analysis.
problem Improving multi-task learning performance through shared knowledge.
method Two-phase iterative aggregation of targets and features using bias-variance analysis.
result Validation on synthetic and real-world datasets demonstrates the effectiveness of the proposed method.