In this paper we studied about the wavelet identification of the thresholds and time delay for more general case without the constraint that the time delay is smaller than the order of the model. Here we composed an empirical wavelet from the SETAR (Self-Exciting Threshold Autoregressive) model and identified the thres…
Optimal algorithm for identifying best arm in stochastic linear bandits with fixed confidence.
problem Identifying the best arm in stochastic linear bandits with fixed confidence.
method Extending an algorithm designed for Best Arm Identification to the ε ε ε -Thresholding Bandit Problem (TBP). result Asymptotically optimal algorithm for TBP.
New algorithm identifies good arms with fewer samples when thresholds are close.
problem Good arm identification in bandit problems with small threshold gaps.
method Proposes lil'HDoC algorithm to improve GAI under small threshold gaps.
result Sample complexity of first λ output arm is nearly identical to HDoC algorithm when thresholds are close.
Study lenient regret and good-action identification in Gaussian process bandits.
problem Optimizing function values above a certain threshold in Gaussian process bandits.
method Study lenient regret notions and introduce algorithms for finding good actions.
result Upper and lower bounds on lenient regret for GP-UCB and elimination algorithms.
Paper improves gas species identification in complex mixtures using neural networks.
problem Identifying gas species in multi-gas mixtures with high accuracy.
method Multi-label neural networks with optimal thresholding for IR spectroscopy.
result Optimal thresholding improves classification performance over conventional methods.
Paper tackles good arm identification in stochastic bandits.
problem Identifying good arms with minimal samples.
method Proposes DGAI, a differentiable algorithm to improve sample complexity.
result DGAI outperforms baseline algorithms in synthetic and real-world datasets.
The paper analyzes methods for sparse Bayesian regression in nonlinear system identification.
problem Learning sparse models in Bayesian regression with nonlinear applications.
method Two classes of methods: regularization and thresholding based, built on automatic relevance determination (ARD).
result Analytical demonstration of favorable performance with sparse solutions in linear problems.
This paper improves thresholding bandit problem algorithms.
problem Identifying arms with rewards above a threshold.
method Asynchronous parallel empirical variance guided algorithms.
result Optimal round complexity improvement for all arms with bounded high order moments.
Paper proposes a method to identify optimal threshold for stock market networks.
problem Challenges in identifying the optimal threshold for reliable stock network construction.
method Dynamic consistence between threshold network and stock market, optimal threshold maximized by consistence function.
result Optimal threshold value of 0.28 for stocks in S&P 500 Index.
New algorithm STCV improves sparse model discovery from normalised data.
problem Distortion of sparse model discovery due to data scaling.
method STCV, a novel sparse regression algorithm robust to data scaling.
result STCV outperforms standard methods on normalised, noisy datasets.
WSINDy for PDEs robustly identifies models from noisy data.
problem Identifying nonlinear dynamics from noisy partial differential equations data.
method Weak formulation of PDEs, Fourier-based model identification, sequential-thresholding least-squares.
result WSINDy enables robust identification of PDEs in noisy conditions.
Paper identifies sparse linear systems with few samples, achieving exact recovery.
problem Sparse system identification with limited data.
method Block-regularized estimator for sparse linear systems.
result The estimator achieves small element-wise error with polynomially many samples relative to sparsity.
Online algorithm identifies PDEs from noisy data snapshots.
problem Identifying PDEs from sequential solution snapshots.
method Combines weak-form discretization with online proximal gradient descent.
result Efficiently identifies and tracks systems with time-varying coefficients.
Donors who defer their donations volunteer less in the future.
problem Volunteer labor can be less beneficial to charities than its costs.
method Regression discontinuity design with a procedure to handle manipulation.
result Donor manipulation invalidates standard regression discontinuity design, but a new method provides partial identification bounds.
New algorithm finds best feasible arm in grouped bandits.
problem Finding the best arm with all attributes above a threshold.
method Feasibility Constrained Successive Rejects (FCSR) algorithm.
result FCSR identifies the best feasible arm with optimal dependence on problem parameters.
This work optimizes identifying good arms in nonparametric multi-armed bandits.
problem Efficiently identifying arms with high means in nonparametric settings.
method Combining reward-maximizing sampling with a nonparametric sequential test for anytime-valid labeling.
result Achieves minimax optimal stopping times for identifying arms above a threshold.
Identifies arms with rewards significantly different from the majority.
problem Identifying arms with rewards deviating substantially from the majority.
method Computing outlier threshold using median and median absolute deviation.
result Proposes two δ-PAC algorithms for ROAI with upper bounds on sample complexity and worst case lower bound.
Optimal top-2 method improves best arm identification with reduced error.
problem Identifying the arm with the highest mean in a set of arms.
method A novel top-2 algorithm that pulls the empirical best arm with probability β and the challenger arm otherwise.
result The proposed algorithm matches the information theoretic lower bound on sample complexity as δ approaches 0.
New algorithm achieves near optimal sample complexity for 1-identification problem.
problem Determining if an arm's mean reward is at least a known threshold with high probability.
method Design of Sequential-Exploration-Exploitation (SEE) algorithm with non-asymptotic analysis.
result Achieves near optimality in sample complexity, matching upper and lower bounds up to a polynomial logarithmic factor.
BAICS identifies best arm with fairness constraints on subpopulations.
problem Identify the best arm while ensuring fairness across subpopulations.
method Formulated and solved BAICS problem, analyzed complexity, designed algorithm.
result Algorithm's sample complexity matches theoretical lower bound.
The study examines when to trust confidence thresholding in pseudo-labelling regression.
problem Calibrated probabilities from classifiers used for pseudo-labelling need careful handling to avoid bias in downstream regression.
method Developed a diagnostic apparatus to predict and bound the bias induced by confidence thresholding, derived a closed-form expression for the attenuation bias.
result The bias can be predicted from the residual score variance V ∗ V^{*} V ∗ , motivating a structural separation between classifier features and downstream controls. Bayesian method improves hit identification in compound screening.
problem Identifying candidate hits from thousands to millions of compounds.
method Bayesian nonparametric modeling for cross-plate correlation and statistical strength.
result Significant improvements in hit identification sensitivity and specificity.
A new bandit problem identifies good arms with minimal samples.
problem Identifying good arms with expected reward above a threshold.
method Stochastic multi-armed bandit problem with exploration-exploitation dilemma.
result Lower bound on sample complexity and efficient algorithm development.
VA-LUCB identifies best arm with variance constraint, achieving optimal sample complexity.
problem Identifying the best arm with variance constraint under fixed confidence.
method Parameter-free algorithm VA-LUCB, analyzing sample complexity and proving lower bounds.
result Optimal sample complexity up to a logarithmic factor in H V A H_{VA} H V A , demonstrated by experiments. The labeled stochastic block model is a random graph model representing networks with community structure and interactions of multiple types. In its simplest form, it consists of two communities of approximately equal size, and the edges are drawn and labeled at random with probability depending on whether their two en…
A new method identifies EMTE causes using CNN and unsupervised feature learning.
problem Identifying causes of EMTEs in power grids.
method Spatiotemporal unsupervised feature learning with CNN and softmax.
result Validation through EMTP and RTDS simulations of various events.
Study improves early warning models for currency and stock market crises.
problem Predicting currency and stock market crises.
method Synthetic review and comparison of early warning models, focusing on crisis identifications and predictive models.
result SWARCH model with elastic thresholding methodology most accurately classifies crisis observations.
This work improves SINDy-type algorithms for system identification using score-guided dictionary selection.
problem Improving accuracy and interpretability in dynamical system identification.
method Score-guided library selection to refine dictionary terms in sparse regression.
result Score-guided methods enhance SINDy's robustness in discovering governing equations.
Sharp large deviations and Gibbs conditioning for portfolio credit risk models.
problem Analyzing the risk of default in financial portfolios with dependent factors.
method Sharp large deviation estimates and conditional Bahadur-Rao estimates for threshold models with diverging latent factors.
result Conditioned on a large exceedance event, default indicators become asymptotically i.i.d., and loss-given-default is exponentially tilted.
New techniques improve the accuracy of identifying nonlinear systems from noisy data.
problem Identifying nonlinear dynamical systems from noisy state measurements.
method Comparative study of local and global smoothing techniques to denoise state measurements and improve sparse regression methods.
result Global smoothing methods outperform local methods in improving the accuracy of governing equation recovery.
Extends extreme value mixture models to identify changepoints in financial extreme regimes.
problem Inference over financial extreme regimes is affected by threshold choice.
method Extends extreme value mixture models to account for distributional extreme changepoints using MCMC algorithms.
result Inclusion of different extreme regimes improves financial applications compared to static and dynamic approaches.
New algorithm for active exploration in bandit problems.
problem Active exploration in bandit problems.
method Gradient ascent with online lazy mirror ascent sampling rule.
result Asymptotically optimal and computationally efficient.
Unified algorithm for efficient pure exploration using dual variables.
problem Efficiently achieving a specific goal through adaptive experimentation.
method Introducing dual variables to derive optimal allocation conditions, leading to Information-Directed Selection.
result Top-two Thompson sampling attains asymptotic optimality for Gaussian best-arm identification.
APGAI identifies good arms anytime with fixed budget.
problem Identifying a good arm with a fixed sampling budget.
method An anytime algorithm for good arm identification in stochastic bandits.
result APGAI achieves efficient detection of good arms with upper bounds on probability of error and sampling complexity.
New method identifies network structure without regularization for sparse teacher couplings.
problem Identifying network structure in inverse Ising problems with model mismatch.
method Ridge linear regression with two-stage estimator.
result Perfect identification of network structure possible without regularization for sparse teacher couplings.
Optimal rank-adaptive matrix estimation from linear measurements.
problem Estimating high-dimensional matrices from linear measurements with adaptive rank selection.
method Combines Least-Squares estimator with universal singular value thresholding.
result Algorithm performance nearly matches fundamental limits.
Study on the limits of learning HMM parameters under various conditions.
problem Understanding the conditions under which hidden Markov model parameters can be learned.
method Nonasymptotic minimax upper and lower bounds, thresholds analysis.
result Nonasymptotic minimax bounds match up to constants, showing learnable thresholds.
New algorithms find all ε-good arms in stochastic bandits.
problem Finding all arms with means above a specified threshold in stochastic bandits.
method Two algorithms introduced to identify all ε-good arms.
result Demonstrated great empirical performance on large datasets.
WSINDy algorithm proves robust to noise in identifying differential equations.
problem Identifying differential equations from noisy data.
method Weak-form sparse identification of nonlinear dynamics (WSINDy) algorithm.
result WSINDy is asymptotically consistent for a wide class of models, including Navier-Stokes and Kuramoto-Sivashinsky equations.
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.
Researchers identify critical protein residues using advanced graph theory.
problem Identifying essential residues in proteins for function.
method Learning Random Geometric Graphs (RGG) with Cramer's V correlation and organic thresholding.
result Advanced RGG methods accurately identify critical residues compared to existing techniques.
DeepSupp detects financial support levels using attention mechanisms.
problem Traditional SR identification methods fail to adapt to modern markets.
method Multi-head attention mechanisms, dynamic correlation matrices, DBSCAN clustering.
result DeepSupp outperforms six baseline methods across six financial metrics.
Improved reliability of machine learning predictions using variational auto-encoders.
problem Individual unreliability of machine learning models.
method Modified variational auto-encoders to identify a low-dimensional space for reliable classification.
result Improved reliability of predictions and robust identification of adversarial samples.
Study on inferring dynamic communities and links in networks with memory.
problem Inferring communities and links in dynamic networks with memory.
method Maximum likelihood inference from single snapshot observations, analytical and numerical analysis.
result Link persistence makes community detection harder, while community persistence makes it easier.
M-learner estimates treatment effects in mediation models with subgroup identification.
problem Estimating heterogeneous treatment effects in mediation models.
method Four-step procedure: compute conditional effects, construct distance matrix, apply tSNE and K-means clustering, refine clusters.
result Validates robustness and effectiveness in real-world dataset.
Paper tackles adaptive sampling for identifying largest gaps between distributions.
problem Adaptive sampling from K distributions to identify the largest gap between any two adjacent means.
method Proposes elimination and UCB-style algorithms, showing minimax optimality.
result UCB-style algorithms require 6-8x fewer samples than non-adaptive sampling.
This paper presents the first theoretical results showing that stable identification of overcomplete μ μ μ -coherent dictionaries Φ ∈ R d × K Φ\in \mathbb{R}^{d\times K} Φ ∈ R d × K is locally possible from training signals with sparsity levels S S S up to the order O ( μ − 2 ) O(μ^{-2}) O ( μ − 2 ) and signal to noise ratios up to O ( d ) O(\sqrt{d}) O ( d ) . In particular the di…
Study identifies contagion in aggregated defaults despite environmental changes.
problem Identify contagion in aggregated default counts with fluctuating probabilities.
method Compare three contagion mechanisms (Davis-Lo, Torri, Vasicek) under i.i.d. and hierarchical specifications.
result Threshold contagion is largely absorbed into environmental heterogeneity, while cumulative contagion leaves a persistent signature.