New proof links initial class bias to DNN trainability, challenging traditional understanding.
problem Understanding the initial class bias in DNNs and its impact on trainability.
method Theoretical proof linking initial class bias to mean field theories of DNNs.
result Efficient learning is connected to a network's prejudice towards a specific class, contradicting traditional understanding.
New welfare-based fairness notions align with existing error rate balance and predictive parity.
problem Aligning fairness notions with welfare-based criteria.
method Discussing and establishing conditions for envy freeness and prejudice freeness.
result Envy freeness and prejudice freeness are equivalent to error rate balance and predictive parity.
Paper proposes a method to identify and treat latent discriminating features in machine learning models.
problem Fairness issues in machine learning models trained on historical data containing sensitive attributes.
method A novel algorithm that identifies and treats latent discriminating features, agnostic of the learning algorithm.
result Experimental results show near-ideal fairness measurement compared to other methods.
Method trains a debiased model from a biased one by focusing on samples that contradict the bias.
problem Training neural networks can lead to biased predictions due to spurious correlations.
method Train a pair of neural networks, intentionally biasing one and debiasing the other by focusing on contradictory samples.
result Our method significantly improves training against various types of biases, sometimes outperforming explicit supervision methods.
Predictive modeling is increasingly being employed to assist human decision-makers. One purported advantage of replacing human judgment with computer models in high stakes settings-- such as sentencing, hiring, policing, college admissions, and parole decisions-- is the perceived "neutrality" of computers. It is argued…
Machine learning finds new natural laws from noisy data.
problem Discovery of natural laws relies on human inspiration.
method Recursive-LASSO-based symbolic regression (RLS) method.
result Data-driven formulation of natural laws from noisy data.
Contextual bandit algorithms are sensitive to the estimation method of the outcome model as well as the exploration method used, particularly in the presence of rich heterogeneity or complex outcome models, which can lead to difficult estimation problems along the path of learning. We develop algorithms for contextual …
Algorithmic fairness is a field of study that addresses the systematic disadvantage of marginalized groups in machine learning systems.
problem Modern machine learning systems increasingly determine access to economic and social opportunities, leading to structural inequalities and prejudices.
method Statistical and structural approaches to algorithmic fairness.
result The field of algorithmic fairness emerged to address the systematic disadvantage of marginalized groups in machine learning systems.
Examines predictability and complexity of economic time series using symbolic dynamics and entropy.
problem Understanding the predictability and complexity of economic time series.
method Symbolic dynamics and Information theory (entropy and uncertainty).
result Economic time series are complex and can be expressed in terms of information production.
How do we learn from biased data? Historical datasets often reflect historical prejudices; sensitive or protected attributes may affect the observed treatments and outcomes. Classification algorithms tasked with predicting outcomes accurately from these datasets tend to replicate these biases. We advocate a causal mode…
FairLangProc simplifies fairness in NLP models for Python users.
problem Addressing bias in NLP models for decision-making contexts.
method Develops a Python package for implementing fairness metrics and algorithms.
result Promotes the use of bias mitigation techniques in NLP.
To reduce human error and prejudice, many high-stakes decisions have been turned over to machine algorithms. However, recent research suggests that this does not remove discrimination, and can perpetuate harmful stereotypes. While algorithms have been developed to improve fairness, they typically face at least one of t…
Improved 3D generative models for drug design reduce bias and enhance data efficiency.
problem Data sparsity and bias in 3D molecular design models.
method Multi-level contrastive learning protocol for bias control and data efficiency.
result Hierarchical generative models that are topologically unbiased and explainable.
New method detects and mitigates historical bias in data.
problem Detecting and explaining historical bias in data.
method Developed a sample bias criterion and algorithms to measure and counter sample bias.
result Derived bias score provides sample-level attribution and explanation of historical bias.
Recent work in fairness in machine learning has proposed adjusting for fairness by equalizing accuracy metrics across groups and has also studied how datasets affected by historical prejudices may lead to unfair decision policies. We connect these lines of work and study the residual unfairness that arises when a fairn…
Machine learning models are widely adopted in scenarios that directly affect people. The development of software systems based on these models raises societal and legal concerns, as their decisions may lead to the unfair treatment of individuals based on attributes like race or gender. Data preparation is key in any ma…
Contextual bandit algorithms are sensitive to the estimation method of the outcome model as well as the exploration method used, particularly in the presence of rich heterogeneity or complex outcome models, which can lead to difficult estimation problems along the path of learning. We study a consideration for the expl…
Classifies manifolds with dense conjugacy classes in their mapping class groups.
problem Classifying manifolds based on conjugacy classes in their mapping class groups.
method Analyzing connected orientable 2-manifolds and their mapping class groups.
result Mapping class groups of certain manifolds have dense conjugacy classes.
This paper tackles worst-class error rate in classification tasks.
problem Minimizing worst-class error rate in classification tasks, especially in medical image classification.
method Designing a boosting approach to bound the worst-class error rate using Deep Neural Networks (DNNs).
result The proposed boosting approach lowers worst-class test error rates while avoiding overfitting.
New method learns multi-class from single-class data with confidences.
problem Learning multi-class from single-class data without additional data.
method Empirical risk minimization framework for multi-class classification.
result Method achieves Bayes-consistency with noisy confidences.
Paper constructs a cohomology class related to McDuff's secondary class, proving it transgresses to the Euler class of foliated sphere bundles.
problem Finding higher-dimensional analogs of the Calabi invariant and its transgression to the Euler class.
method Constructing a cohomology class of volume-preserving diffeomorphisms and proving transgression to the Euler class of foliated sphere bundles.
result The cohomology class transgresses to the Euler class of foliated sphere bundles.
One of the earliest conjectures in computational learning theory-the Sample Compression conjecture-asserts that concept classes (equivalently set systems) admit compression schemes of size linear in their VC dimension. To-date this statement is known to be true for maximum classes---those that possess maximum cardinali…
The paper proves inequalities for orbifold second Chern classes in Fujiki's class.
problem Inequalities for orbifold second Chern classes of compact normal analytic varieties.
method Generic nefness theorems for tangent and cotangent sheaves, and an orbifold Bogomolov--Gieseker inequality for mixed polarizations.
result Semipositivity of the orbifold second Chern class for varieties with nef anti-canonical divisor.
Study on characteristic classes for foliation deformations.
problem Characterizing and understanding characteristic classes for foliation deformations.
method Introduced a differential graded algebra (DGA) to recover Bott vanishing and formulae, and discussed properties of its cohomology.
result Discovered new classes that cannot be described by existing classes like Godbillon--Vey and Fuks--Lodder--Kotschick.
The hyperelliptic mapping class group has been studied in various contexts within topology and algebraic geometry. What makes this study tractable is that there is a surjective map from the hyperelliptic mapping class group to a mapping class group of a punctured sphere. The more general family of superelliptic mapping…
CILF learns adaptive embeddings for class-incremental learning with novel class detection and model update.
problem Handling unknown classes and model update in streaming data with new classes.
method CILF uses decoupled prototype based loss for intra-class and inter-class structure improvement, and a learnable curriculum clustering operator for adaptive embedding.
result CILF effectively detects multiple novel classes and mitigates embedding confusion, while updating the model without catastrophic forgetting.
In this paper we give explicit formulas of differential characteristic classes of principal G-bundles with connections and prove their expected properties. In particular, we obtain explicit formulas for differential Chern classes, differential Pontryagin classes and differential Euler class. Furthermore, we show that…
A new method identifies class-specific covariates in multi-class prediction tasks.
problem Identifying covariates specifically associated with one or more outcome classes in multi-class prediction tasks.
method Introducing multi forests (MuFs) with multi-way and binary splits to measure class-associated discriminatory ability.
result The multi-class VIM specifically ranks class-associated covariates highly, unlike conventional VIMs.
Study of conjugacy classes in infinite-type surfaces' mapping class groups.
problem Characterizing conjugacy classes in infinite-type surfaces' mapping class groups.
method Model-theoretic methods developed by Kechris, Rosendal, and Truss.
result Detailed classification of conjugacy classes in mapping class groups of infinite-type surfaces.
The paper classifies dense conjugacy classes in mapping class groups of locally finite graphs.
problem Identifying which mapping class groups have dense conjugacy classes.
method Developed flux homomorphisms and combinatorial criteria for stability.
result A complete classification for self-similar locally finite graphs and a criterion for stability.
We give a complete description of conjugacy classes of finite subgroups of the mapping class group of the sphere with r marked points. As a corollary we obtain a description of conjugacy classes of maximal finite subgroups of the hyperelliptic mapping class group. In particular, we prove that for a fixed genus g there …
We present a simple generative framework for learning to predict previously unseen classes, based on estimating class-attribute-gated class-conditional distributions. We model each class-conditional distribution as an exponential family distribution and the parameters of the distribution of each seen/unseen class are d…
SWRLDA improves LDA for multi-class classification with edge classes.
problem LDA's vulnerability to edge classes causing biased mean and large distances.
method Self-weighted robust LDA with l21-norm distance criterion.
result SWRLDA outperforms other methods on synthetic and real-world datasets.
For a local Lie group M we define odd order cohomology classes. The first class is an obstruction to globalizability of the local Lie group. The third class coincides with Godbillon-Vey class in a particular case. These classes are secondary as they emerge when curvature vanishes.
This paper proposes a novel generic one-class feature learning method based on intra-class splitting. In one-class classification, feature learning is challenging, because only samples of one class are available during training. Hence, state-of-the-art methods require reference multi-class datasets to pretrain feature …
This research sets limits on how complex multi-class learning problems can be.
problem Understanding the complexity of multi-class classification problems.
method Established upper bounds on Natarajan dimensions for specific function classes.
result Upper bounds on Natarajan dimensions for multi-class decision trees, random forests, and neural networks.
Infinitely many unique ways to generate a surface's mapping class group.
problem Identifying unique ways to generate mapping class groups.
method Analyzing Nielsen equivalence classes of two-element generators.
result There are infinitely many unique ways to generate a surface's mapping class group.
Characteristic classes of oriented vector bundles can be identified with cohomology classes of the disjoint union of classifying spaces BSO_n of special orthogonal groups SO_n with n=0,1,... A characteristic class is stable if it extends to a cohomology class of a homotopy colimit BSO of classifying spaces BSO_n. Simil…
Study rigid classes on hyperkahler manifolds, showing general ones are rigid.
problem Characterize rigid classes on compact hyperkahler manifolds.
method Analyze eigenvectors of hyperbolic automorphisms and use BBF form.
result General parabolic classes on hyperkahler manifolds are rigid.
Defines kappa classes on KSBA spaces, generalizing classes on curves.
problem Generalizing Miller-Morita-Mumford classes to KSBA stable varieties and pairs.
method Defining kappa classes on KSBA moduli spaces and computing them in specific cases.
result Computed kappa classes on Campedelli surfaces, including finding the Chow ring of a specific GIT quotient.
By analyzing how the Borel regulator classes vanish on various groups related to GL(n,Z), we define three series of secondary characteristic classes for subgroups of automorphism groups of free groups. The first case is the IA-automorphism groups and we show that our classes coincide with…
DRAGON improves learning for rare classes in unbalanced datasets using class descriptions.
problem Learning rare classes in unbalanced datasets with deep models.
method DRAGON is a late-fusion architecture that corrects bias towards frequent classes and fuses class-descriptions to improve tail-class accuracy.
result DRAGON outperforms state-of-the-art models on new benchmarks for long-tail learning with class descriptors.
Gen1S learns novel classes with 1-shot data using residual space and generative models.
problem Learning new classes with limited data in a growing dataset.
method Mapping embeddings to a residual space, using generative models to learn multi-modal distribution, and applying it as a structural prior.
result Consistent improvement over state-of-the-art methods in recognizing novel classes.
We study types of mapping classes which arise as a product of a given mapping class and powers of certain pure mapping classes. We derive an explicit constant depending only on a surface such that almost all above pure mapping classes give rise to pseudo-Anosov type whenever their powers are larger than the constant. F…
New classes defined for manifold pseudogroups, linking to cohomology and bundle structures.
problem Characterizing pseudogroups of diffeomorphisms using characteristic classes.
method Defined Godbillon-Vey-Losik and first Chern-Losik classes via de Rham cohomology and frame bundles.
result Explicit expressions and geometric representations for the new classes.
Paper tackles many-class few-shot learning with class hierarchy, improving accuracy.
problem Many-class few-shot learning problem in practical applications.
method Leverages class hierarchy to train a coarse-to-fine classifier using memory-augmented hierarchical-classification network (MahiNet).
result MahiNet outperforms state-of-the-art models on MCFS problems in both supervised and meta-learning settings.
Solutions to Strominger system found for square of Kähler class.
problem Finding solutions to Strominger system with specific balanced classes.
method Deforming Calabi-Yau and Hermitian-Yang-Mills metrics.
result Classes that are squares of Kähler metrics admit solutions.
Continuous epimorphisms between certain mapping class groups are induced by homeomorphisms.
problem Understanding continuous epimorphisms between specific mapping class groups.
method Analyzing subgroups of mapping class groups of infinite-genus 2-manifolds with no planar ends.
result Continuous epimorphisms are induced by homeomorphisms for the specified subgroups.