20 results for “Linear classifiers”
CS papers onlyHybrid search: Keyword + semantic, ranked by combined score.ⓘ
Want pure semantic search? Try claim verification →
This paper establishes a large deviation principle for the generalization error of interpolating classifiers in the overparametrized regime.
This paper derives deterministic limits for transfer learning performance of linear discriminant analysis in high-dimensional two-class classification under spiked covariance models.
The paper studies the problem of learning a drifting concept in the presence of Massart noise and provides an efficient learner with improved error rate for margin-separable linear classifiers.
This paper demystifies neural networks for classical statisticians by describing networks that approximate linear regression and common customizations.
This paper extends gradient boosting to functions of vector inputs using a simple algorithm with histogram-based decision trees.
This paper improves the sample complexity of learning robust predictors to adversarial examples using a simple algorithm that combines bagging and robust empirical risk minimization.
A new boosting algorithm that strong learns concept classes closed under O(log 1/γ)-XOR using O(log 1/ε) calls to a γ-advantage weak learner and additional samples, by connecting boosting with list-de…
The paper proves that the majority vote of three independent consistent classifiers is an optimal learner in the realizable PAC setting.
This paper proposes a novel estimator for the target linear coefficient in a partial linear model with black-box nuisance estimation and establishes its unimprovable error rate.
The paper formalizes the problem of representation identifiability in supervised learning, showing that a representation property is identifiable if and only if it is constant across all possible fact…
The twoblock clustering tree is introduced as a new type of interpretable regression tree for multivariate responses, using local multivariate linear models as leaves and twoblock dimension reduction…
This paper compares PCA and LPC for dimensionality reduction in cyberattack classification, demonstrating that both techniques can achieve substantial feature compression with minimal loss of classifi…
The paper proposes a general approach to augmenting exact exponential-time algorithms for NP-hard problems using machine-learned predictions.
This paper develops statistical learning theory for gradient boosting in Peaks-over-Threshold modeling using Generalized Pareto distributions, deriving error bounds and reducing gradient correlation.
The paper proposes a novel approach to regression tasks using classification inspired by fruitflies' environmental sensing, replacing complex global models with a library of local patterns for nonline…
This paper identifies scattering network architectures that maximize separation capacity for data with low intrinsic dimension by characterizing and bounding the separation capacity of general feature…
The paper proves a lower bound on the number of value-oracle queries required for a certain type of approximation algorithm.
This paper derives deterministic equivalents for the prediction risk of over-parameterized linear regression with degenerate covariance matrices and dependent covariates, and identifies the configurat…