Solves selecting the best optimizing system problems.
problem Selecting the best system among contenders with unknown performance.
method Adaptive algorithms integrating stochastic gradient descent and sequential elimination.
result Exponential rates of convergence to zero for false selection probability.
Auto-Surprise automates recommender system selection and optimization.
problem Finding the best algorithm and hyperparameters for recommender systems.
method Extends Surprise library with TPE optimization for algorithm selection and hyperparameter tuning.
result Significantly faster in finding optimal hyperparameters compared to grid search.
We consider technology-assisted mimicry attacks in the context of automatic speaker verification (ASV). We use ASV itself to select targeted speakers to be attacked by human-based mimicry. We recorded 6 naive mimics for whom we select target celebrities from VoxCeleb1 and VoxCeleb2 corpora (7,365 potential targets) usi…
Dynamic classifier selection systems aim to select a group of classifiers that is most adequate for a specific query pattern. This is done by defining a region around the query pattern and analyzing the competence of the classifiers in this region. However, the regions are often surrounded by noise which can difficult …
Automated method selects best model from many for production systems.
problem Selecting the best model for production systems from a large pool.
method Automated online experimentation mechanism using Bayesian surrogate models.
result Efficiently identifies the best model with small online experiments.
Proposes a privacy-preserving sign selection method for distributed systems.
problem Sign selection in distributed differentially private settings.
method Iterative peeling of stability function combined with exponential mechanism.
result Recovery of support and signs with optimal signal-to-noise ratio.
Optimal algorithm selects biological models without prior info.
problem Determining the correct biological model without prior knowledge.
method Systems biology models and likelihood-free inference.
result Improved model selection performance over conventional methods.
Can we manipulate multiple deep neural networks simultaneously?
problem Selective fooling of multiple machine learning systems.
method Formulated as a novel optimization problem.
result It is easy to selectively manipulate multiple MNIST classifiers simultaneously.
Paper addresses selection bias in online advertising auctions.
problem Selection bias affects auction truthfulness and advertiser profits.
method Theoretical analysis combined with multi-task learning.
result Selection bias can be significantly reduced using multi-task learning.
Machine learning improves Buchberger's algorithm for polynomial systems.
problem Optimizing S-pair selection in Buchberger's algorithm for polynomial systems.
method Reinforcement learning agents trained with PPO to select S-pairs.
result Trained model outperforms existing heuristics in polynomial additions.
This paper tackles selection bias in recommender systems by considering the neighborhood effect.
problem Selection bias in recommender systems due to filtering and user selection.
method Formalizes neighborhood effect as interference problem, introduces treatment representation, and proposes ideal loss.
result Proposed methods achieve unbiased learning when both selection bias and neighborhood effect are present.
CASP selects reliable policies for two-stage recommender systems by considering both value and support.
problem The selection of a generator in two-stage recommender systems affects both the policy value and the data support used to estimate it.
method CASP combines doubly robust value estimation with a support-burden penalty.
result CASP selects lower-burden policies when estimated value and support credibility are in tension.
New approach uses secants to improve sensor placement and feature selection for nonlinear systems.
problem Inadequacy of linear methods for minimal sensor placement and feature selection in nonlinear systems.
method Data-driven approach using secant vectors to develop greedy algorithms for robust, near-minimal reconstruction guarantees.
result Demonstrated on two problems where linear techniques fail, secant-based approach provides robust solutions.
Federated LIDAR aided beam selection reduces mmWave beam search overhead.
problem Efficient link configuration in mmWave communication systems with reduced beam search overhead.
method Federated learning of LIDAR data to train a shared neural network for beam selection.
result Proposed method significantly outperforms previous works in performance and complexity.
Feature Selection (FS) plays an important role in learning and classification tasks. The object of FS is to select the relevant and non-redundant features. Considering the huge amount number of features in real-world applications, FS methods using batch learning technique can't resolve big data problem especially when …
ADRL improves participant selection in MCS systems.
problem Designing a participant selection algorithm for different MCS systems with multiple goals.
method Auxiliary-task based deep reinforcement learning (ADRL) using transformers and pointer networks.
result ADRL outperforms other baselines in various MCS settings.
DeepUnHide uses deep learning to reveal hidden demographic features in recommender systems.
problem Extracting hidden demographic features from recommender systems factors.
method Gradient-based localization in deep learning for feature extraction.
result DeepUnHide outperforms state-of-the-art feature selection methods.
Automates feature selection and weighting in molecular systems.
problem Optimal feature selection and alignment in molecular systems.
method Differentiable Information Imbalance (DII) method for automated feature ranking and scaling.
result Automated feature selection and scaling that preserves information content and interpretability.
Dynamic regressor selection (DRS) systems work by selecting the most competent regressors from an ensemble to estimate the target value of a given test pattern. This competence is usually quantified using the performance of the regressors in local regions of the feature space around the test pattern. However, choosing …
ARDA automatically augments datasets for machine learning models.
problem Improving machine learning model performance through data augmentation.
method ARDA combines data searching, joining, and feature selection to augment datasets.
result Training models on ARDA's augmented datasets leads to better performance.
A new method for decision tree selection in recommendation systems.
problem Feature-based selection of a single tree from an ensemble for dynamic interpretation.
method A multi-armed contextual bandit recommendation framework that trains a system on top of Random Forests to identify the most relevant tree.
result The dynamic method outperforms an independent CART tree and is comparable to Random Forest in predictive performance.
Study optimizes resource allocation in noisy systems for better control.
problem Limited attention in stochastic systems with multiplicative noise.
method Analytical and numerical methods for optimal attention allocation.
result Effective resource allocation enhances noise estimation and control decisions.
ICU mortality scoring systems attempt to predict patient mortality using predictive models with various clinical predictors. Examples of such systems are APACHE, SAPS and MPM. However, most such scoring systems do not actively look for and include interaction terms, despite physicians intuitively taking such interactio…
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.
A fuzzy expert system selects stocks for BSE using AI techniques.
problem Selecting stocks for investment allocation is challenging due to many influencing factors.
method Dempster-Shafer (DS) evidence theory for rule base generation, portfolio optimization model with ACO algorithm.
result The model's performance is satisfactory for short-term investment.
Method selects most useful network model for various tasks.
problem Impact of translating raw data to network models is unexamined.
method Proposes a network model selection methodology focusing on utility and parsimony.
result Demonstrates the importance of network definition for system behavior.
Statistical guarantees for hyperparameter selection
problem Hyperparameter selection in AI systems
method Learn-then-test framework
result Provable reliability and safety
New DL algorithm estimates OFDM channels without pilots.
problem Estimating OFDM channels in deep fading conditions.
method Deep learning (DL) for blind channel estimation.
result First theory on MSE performance of DL-based estimator.
We describe a method for selecting relevant new training data for the LSTM-based domain selection component of our personal assistant system. Adding more annotated training data for any ML system typically improves accuracy, but only if it provides examples not already adequately covered in the existing data. However, …
Recommender systems often face heterogeneous datasets containing highly personalized historical data of users, where no single model could give the best recommendation for every user. We observe this ubiquitous phenomenon on both public and private datasets and address the model selection problem in pursuit of optimizi…
Unsupervised clustering can reproduce categorization systems if features and metrics are correctly selected.
problem Reproducing expert-provided categorization systems using unsupervised clustering.
method Investigated using toy datasets and real-world fund categorization. Used appropriate feature selection and a supervised Random Forest-based distance metric.
result Unsupervised clustering can reproduce ground truth classes if features and metrics are correctly selected.
Two novel methods identify influential features in CMABs for better reward distribution.
problem Suboptimal features degrade rewards, interpretability, and efficiency in CMABs.
method Heterogeneous Incremental Effect (HIE) and Heterogeneous Distribution Divergence (HDD) methods.
result Consistent ability to identify influential HTE features, enhancing CMAB performance.
A system of nested dichotomies is a method of decomposing a multi-class problem into a collection of binary problems. Such a system recursively splits the set of classes into two subsets, and trains a binary classifier to distinguish between each subset. Even though ensembles of nested dichotomies with random structure…
The paper introduces a framework to select efficient datasets for preserving model rankings.
problem Efficient evaluation of machine learning models on small, representative datasets.
method Bootstrap aggregation, clustering, design criteria, random baselines, and greedy farthest-first (FAFI).
result Several selection strategies improve rank preservation compared to random subsets, especially in time series classification.
Develops a method for identifying structured dynamical systems from data.
problem Identifying structured dynamical systems from undersampled and noisy data.
method Sparse least-squares fitting via ℓ1−ℓ2 optimization with the alternating direction method of multipliers. result The method is stable and successful under certain conditions, as shown by theoretical guarantees and computational results.
Wireless communication systems operate in complex time-varying environments. Therefore, selecting the optimal configuration parameters in these systems is a challenging problem. For wireless links, \emph{rate selection} is used to select the optimal data transmission rate that maximizes the link throughput subject to a…
This paper uses machine learning to select kernels for machine learning models on various devices.
problem Traditional kernel auto-tuning is limited for machine learning research with changing network topologies and hyperparameters.
method Combines auto-tuning and machine learning to select kernels for SYCL on various devices.
result Initial results show high performance kernel selection with little developer effort.
mNARX+ creates accurate surrogate models for complex systems without requiring domain expertise.
problem Creating accurate surrogate models for complex dynamical systems without extensive domain knowledge.
method Data-driven, recursive algorithm that automatically selects temporal features and their causal ordering.
result Automatically identifies critical auxiliary quantities and their order for accurate modeling.
A new method selects variables efficiently for fast and accurate dynamic system identification.
problem Efficiently selecting variables for scalable Gaussian processes.
method Forward variable selection using Karhunen-Loève decomposition and Gibbs sampling.
result Method yields competitive accuracies and inference times for dynamic systems.
This paper improves context-aware recommender systems by selecting and incorporating relevant low-dimensional contextual information.
problem Generating accurate recommendations is not enough; contextual information can cause issues like battery drain and privacy.
method Developed a feature-selection algorithm based on genetic algorithms to reduce context dimensions while maintaining explainability.
result The approach improves accuracy and transparency in recommendations, outperforming state-of-the-art models.
Novel Bayesian model improves EEG-based BCI character selection.
problem Accurately identifying target-related responses in EEG-based BCIs.
method Probit-link Split-and-merge Gaussian Process (P-SMGP) prior for feature selection.
result Reduces computational complexity and provides interpretable statistical interpretations.
Proposes a robust equilibrium strategy for mean-variance portfolio selection.
problem Time-inconsistency in mean-variance portfolio selection.
method Introduces a novel definition of robust equilibrium strategy and solves the corresponding PDE system.
result A classical solution to the PDE system implies a robust equilibrium strategy.
An active margin system for margin loans is proposed for Chinese margin lending market, which uses cash and randomly selected stock as collateral. The conditional probability of negative return(CPNR) after a forced sale of securities from under-margined account in a falling market is used to measure the risk faced by t…
New metrics CWSA and CWSA+ improve model evaluation under confidence thresholds.
problem Lack of metrics capturing model reliability under confidence thresholds.
method Introducing CWSA and CWSA+ metrics that reward confident accuracy and penalize overconfident mistakes.
result CWSA and CWSA+ outperform classical metrics in trust-sensitive tests.
Artificial Intelligence (AI) can now automate the algorithm selection, feature engineering, and hyperparameter tuning steps in a machine learning workflow. Commonly known as AutoML or AutoAI, these technologies aim to relieve data scientists from the tedious manual work. However, today's AutoAI systems often present on…
Expert system predicts credit card charge-offs using macroeconomic indicators.
problem Managing charge-off rates in the credit card industry.
method Developed an expert system using machine learning and macroeconomic indicators.
result Achieved mean squared error values of 1.15E-03 and 1.04E-03.
Two simulation-based methods improve optimal sampling design in systems biology.
problem Optimal selection of sampling points for accurate parameter estimation in dynamical systems.
method E-optimal-ranking (EOR) and LSTM neural network-based methods.
result Simulation studies show the proposed methods outperform random selection and classical E-optimal design.
Paper tackles selective regression using uncertainty estimation.
problem Selective regression for machine learning models to avoid predictions when uncertain.
method Model-agnostic non-parametric uncertainty estimation.
result Superior performance compared to state-of-the-art selective regressors.