Neural eliminators reduce unreliable classification by eliminating improbable classes.
problem Unreliable classification due to noise, insufficient data, overlapping distributions, and unclear class definitions.
method Construct eliminators using classifiers with modified error functions, assigning cases to multiple classes instead of one.
result Elimination of improbable classes improves classification accuracy in real-life medical applications.
Proposes a flexible tournament design combining knockout and round-robin.
problem Designing a tournament that eliminates participants linearly.
method Combines knockout and round-robin structures for flexible elimination.
result Flexible tournament design can eliminate participants linearly.
Improved elimination strategies for adaptive bandit identification reduce sample complexity and computational burden.
problem Inefficient elimination strategies in bandit identification.
method Adaptive elimination methods that update sampling rules frequently and reduce problem size.
result Adaptive elimination methods achieve better sample complexity and computational efficiency.
AE-DQN learns to eliminate sub-optimal actions in complex RL environments.
problem Challenges in RL with many actions, especially redundancy.
method Combines DQN with AEN that predicts invalid actions.
result Significant speedup and robustness in games with many actions.
New algorithm eliminates arms to minimize regret in complex bandit problems.
problem Minimizing regret in combinatorial bandit problems with explicit exploration.
method Introduces a novel arm elimination scheme that partitions arms into three categories and incorporates explicit exploration.
result Achieves near-optimal regret in combinatorial multi-armed and linear contextual bandit problems.
Tensor variable elimination for plated factor graphs enables exact inference in models with repeated structure.
problem Efficient inference in models with repeated structure.
method Generalized variable elimination to tensor variable elimination on plated factor graphs.
result Tractable inference for a class of plated factor graphs.
We introduce Neural Choice by Elimination, a new framework that integrates deep neural networks into probabilistic sequential choice models for learning to rank. Given a set of items to chose from, the elimination strategy starts with the whole item set and iteratively eliminates the least worthy item in the remaining …
Aims to eliminate domain bias in authentication without domain labels.
problem Authentication models are biased due to domain differences.
method Discover latent domains and eliminate domain difference alternately, using a meta-learning framework.
result Eliminates domain difference in authentication without domain labels.
This paper proves adding neurons eliminates all bad local minima in deep learning.
problem Eliminating all suboptimal local minima in deep learning models.
method Adding one special neuron per output unit eliminates all suboptimal local minima of deep neural networks.
result At every local minimum, the original neural network parameters are a global minimum.
We simplify Khovanov homology for torus braids using Gaussian elimination.
problem Computing Khovanov homology for torus braids is complex and computationally intensive.
method Applying Gaussian elimination to reduce the number of generators in the Khovanov chain complex.
result We provide a bound on the number of generators in the whittled complex at fixed homological degree.
AMBER method selects features efficiently using autoencoders and model-based elimination.
problem Efficiently selecting relevant features for classification.
method Greedy backward elimination using a ranker model and autoencoders.
result AMBER outperforms other feature selection methods in classification accuracy.
Logic approach finds real singularities in differential equations.
problem Finding geometric singularities of implicit ODEs over the reals.
method Vessiot theory, parametric Gaussian elimination, heuristic simplification, real quantifier elimination.
result Effective computation of geometric singularities using logic methods.
We develop an approach for feature elimination in statistical learning with kernel machines, based on recursive elimination of features.We present theoretical properties of this method and show that it is uniformly consistent in finding the correct feature space under certain generalized assumptions.We present four cas…
Two new feature selection algorithms improve on RFE.
problem Optimal feature selection for faster and more accurate models.
method Fibonacci and k-Subsecting Recursive Feature Elimination.
result Faster feature selection with comparable predictive performance.
PoWER-BERT speeds up BERT inference by eliminating redundant word-vectors.
problem Improving BERT inference speed without sacrificing accuracy.
method Eliminating redundant word-vectors using a self-attention-based significance measure and learning the number of vectors to eliminate.
result Up to 4.5x reduction in inference time with <1% loss in accuracy on GLUE benchmark.
GPE algorithm optimizes nonparametric contextual bandits with efficient regret bounds.
problem Optimizing nonparametric contextual bandits with efficient regret bounds.
method Inspired by Policy Elimination, GPE uses oracle-efficient techniques for nonparametric classes with infinite VC-dimension.
result GPE is regret-optimal for policy classes with integrable entropy, and for larger entropy, it provides an ε \varepsilon ε -greedy algorithm with matching regret bounds. Paper tackles online learning in large MDPs with low Bellman rank using AVE algorithm.
problem Online learning of MDPs with large state spaces.
method Develops AVE algorithm inspired by OLIVE, using contextual bandit problems and elimination steps.
result Achieves n \sqrt{n} n -regret for learning optimal value function in MDPs with function approximation and low Bellman rank. A new method eliminates reward estimation variance in sequential decision processes.
problem High variance in gradient estimation hinders sample efficiency in reinforcement learning.
method Proposes an unbiased method that completely eliminates variance under certain conditions.
result The proposed method significantly improves performance in challenging problems with delayed rewards.
Probabilistic graphical models offer a powerful framework to account for the dependence structure between variables, which is represented as a graph. However, the dependence between variables may render inference tasks intractable. In this paper we review techniques exploiting the graph structure for exact inference, b…
New proof eliminates definite fold in higher dimensions.
problem Eliminating definite fold in higher dimensions.
method Homotopy and algorithmic procedures for constructing examples.
result Non-existence of singular Legendre fibrations on 3-manifolds.
ANNs speed up radiation transport solving by 4x with minimal error.
problem Solving large-scale radiation transport problems efficiently.
method Artificial Neural Networks (ANNs) replacing Gaussian Elimination.
result ANNs reduce solution time by at least 4x with 1-3% error.
New algorithm simplifies unknot recognition with polynomial complexity.
problem Unknot recognition in knot theory.
method Quantifier elimination in real closed fields.
result Algorithm with complexity 2 O ( n ) 2^{\mathcal{O}(n)} 2 O ( n ) for n n n crossings. Quantifier elimination enhances safety assurance of deep neural networks.
problem Rigorously assure safe operation of sophisticated, autonomous systems like DNNs.
method Use quantifier elimination as a formal method to enhance safety assurance.
result Initial results show QE can precisely analyze robustness of DNNs.
A new algorithm optimizes local objectives in federated learning with heterogeneous clients.
problem Optimizing local objectives in federated learning with heterogeneous client data.
method Proposes PF-PNE algorithm with double elimination strategy.
result PF-PNE algorithm optimizes local objectives with arbitrary heterogeneity and protects client data confidentiality.
New method improves variational bounds on partition function.
problem Computing the partition function of discrete graphical models is intractable.
method Combines gauge transformations with weighted mini-bucket elimination (WMBE).
result WMBE-G strictly improves earlier WMBE approximation for symmetric models.
A new private algorithm for bandit problems meets lower bounds.
problem Optimal private solution for stochastic multi-arm bandit.
method Private Successive Elimination based on optimal private stopping rule.
result Optimal private algorithm meets both non-private and private lower bounds.
Paper eliminates warm-up phase for PO in linear MDPs, achieving optimal regret.
problem Costly warm-up phase in PO algorithms for linear MDPs.
method Simple contraction mechanism replaces warm-up phase.
result Achieves rate-optimal regret with improved dependence on problem parameters.
Robust algorithm optimizes corrupted Gaussian process bandits.
problem Sequential optimization of corrupted, expensive reward functions.
method Robust GP Phased Elimination (RGP-PE) algorithm.
result Algorithm balances robustness to corruptions with exploration and exploitation.
Classifies SL(n) covariant matrix-valued valuations on Lp-spaces.
problem Classifying SL(n) covariant matrix-valued valuations on Lp-spaces.
method Established a complete classification for continuous and SL(n) covariant matrix-valued valuations on Lp(Rn,|x|2dx), eliminating matrix symmetry assumption.
result Unique characterization of such valuations by the moment matrix in n>2, rotation matrix in 2D.
The paper discusses the impossibility of eliminating surplus intersections in Lagrangian submanifolds.
problem Can surplus intersections in Lagrangian submanifolds be eliminated by Hamiltonian isotopy?
method Analyzing the intersections and isotopies of Lagrangian submanifolds and auxiliary Lagrangians.
result Surplusection cannot be eliminated in several important situations, highlighting the need for better understanding.
Balances and eliminates base algorithms in bandits and RL to bound total regret.
problem Model selection in bandits and reinforcement learning with unknown optimal regret.
method Balances and eliminates base algorithms based on candidate regret bounds.
result Total regret bound is the best valid candidate regret bound times a small multiplicative factor.
New method eliminates domain size restrictions for X-ray transform inversion.
problem Injectivity and stability of X-ray transform in convex domains.
method Semiclassical analysis to invert X-ray transform without small domain assumptions.
result Elimination of domain size restrictions for injectivity and stability.
New method simplifies optimization landscapes by transforming saddle points.
problem Saddle points hinder non-convex optimization in machine learning.
method Variable elimination algorithms, like VarPro, are compared to reveal geometric insights.
result Variable elimination reshapes critical point structure, creating local maxima from saddle points.
This paper clarifies vine copula structures using graph and matrix representations.
problem Ambiguity in vine copula representations in literature.
method Graph and matrix representations to clarify vine structures, including cherry and chordal sequences.
result A unique matrix representation of vine structures when given a perfect elimination ordering.
NodeDrop reduces network size by eliminating unnecessary features.
problem Reducing network size for systems with limited memory or processing power.
method Identifies and eliminates nodes carrying no information using regularization.
result Reduces the number of features by a factor of 114x for a VGG-like network on CIFAR10 without a drop in accuracy.
An algorithm learns from multiple models to match an oracle's risk.
problem Learning from multiple noisy models to estimate a target parameter.
method Elimination rounds algorithm for adaptive learning.
result Risk of weak-oracle learner matches that of an oracle in multiple source case.
SurvNet selects important variables in DNNs with false discovery rate control.
problem Variable selection in deep neural networks (DNNs) for interpretability.
method Backward elimination procedure based on a new variable importance measure.
result SurvNet estimates and controls false discovery rate of selected variables.
CRDA improves gene selection in microarray studies by reducing feature space.
problem Gene selection in high-dimensional microarray datasets.
method CRDA combines ℓ q , 1 \ell_{q,1} ℓ q , 1 norm minimization and hard thresholding for feature elimination. result CRDA outperforms competitors in misclassification and feature selection accuracy.
This paper has been withdrawn. Its new version has been published.
SDD improves DD for estimating treatment effects by adjusting for confounding.
problem Estimating treatment effects in observational studies with confounding.
method Synthesized Difference in Differences (SDD) using RCT data to infer correct slopes.
result SDD achieves state-of-the-art performance across synthetic and real datasets.
New algorithms identify Pareto optimal sets in multi-objective bandit problems.
problem Identifying Pareto optimal sets in multi-objective bandit problems.
method Empirical Gap Elimination (EGE) algorithms combining hardness estimation and elimination schemes.
result Two EGE algorithms have exponentially decaying error probabilities with budget.
New study shows non-adaptive trials can be outperformed by adaptive designs in treatment selection.
problem Determining the best allocation of resources in clinical trials.
method Analysis of batched arm elimination designs and comparison with completely randomized trials.
result Simple adaptive designs universally and strictly dominate non-adaptive completely randomized trials for at least three treatment arms.
Extensive neural networks eliminate the need for SABR pricing formulas.
problem Lack of exact pricing formulas for the SABR model.
method Used a GPU-based simulation and an extensive neural network to learn implied volatilities.
result Neural networks achieve high accuracy and efficiency comparable to Monte-Carlo simulations.
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.
Fairness in Naive Bayes classifiers by identifying and eliminating discrimination patterns.
problem Ensuring fairness in machine learning models that use partial observations.
method Discover and eliminate discrimination patterns in naive Bayes classifiers through iterative learning.
result An algorithm that learns fair naive Bayes classifiers by removing discrimination patterns.
We consider the best-arm identification problem in multi-armed bandits, which focuses purely on exploration. A player is given a fixed budget to explore a finite set of arms, and the rewards of each arm are drawn independently from a fixed, unknown distribution. The player aims to identify the arm with the largest expe…
Stepwise SVM reduces dimensions of large p small n datasets effectively.
problem Reducing dimensions of large p small n datasets.
method Stepwise support vector machine (SVM) for dimension reduction.
result Stepwise SVM achieves better prediction performance and is more stable than other methods.
Method eliminates nuisance functions for spatially varying causal effects.
problem Inferring causal effects in presence of spatial confounding.
method Eliminates nuisance functions, mitigates errors-in-variables.
result Robust and accurate inference of spatially varying heterogeneous causal effects.