paper-with-me

Papers

Feature Qualification by Deep Nets: A Constructive Approach

2025-03-24 · Feilong Cao, Shao-Bo Lin

The great success of deep learning has stimulated avid research activities in verifying the power of depth in theory, a common consensus of which is that deep net are versatile in approximating and learning numerous functions. Such a versatility certainly enhances the understanding of the power of depth, but makes it difficult to judge which data features are crucial in a specific learning task. This paper proposes a constructive approach to equip deep nets for the feature qualification purpose. Using the product-gate nature and localized approximation property of deep nets with sigmoid activation (deep sigmoid nets), we succeed in constructing a linear deep net operator that possesses optimal approximation performance in approximating smooth and radial functions. Furthermore, we provide theoretical evidences that the constructed deep net operator is capable of qualifying multiple features such as the smoothness and radialness of the target functions.

📄 PDF Abstract BibTeX arXiv:2503.18676

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

Sigmoid Activation 설명 없음

Similar Papers 제목 키워드 기반

Detecting and Diagnosing Adversarial Images with Class-Conditional Capsule Reconstructions

2019-07-05 · ICLR 2020 1 · Yao Qin, Nicholas Frosst, Sara Sabour, Colin Raffel 외

Adversarial examples raise questions about whether neural network models are sensitive to the same visual features as humans. In this paper, we first detect adversarial examples or otherwise corrupted images based on a c…

A General Constructive Upper Bound on Shallow Neural Nets Complexity

2025-10-07 · Frantisek Hakl, Vit Fojtik arxiv

We provide an upper bound on the number of neurons required in a shallow neural network to approximate a continuous function on a compact set with a given accuracy. This method, inspired by a specific proof of the Stone-…

A new CP-approach for a parallel machine scheduling problem with time constraints on machine qualifications

2019-10-16 · Arnaud Malapert, Margaux Nattaf

This paper considers the scheduling of job families on parallel machines with time constraints on machine qualifications. In this problem, each job belongs to a family and a family can only be executed on a subset of qua…

Scheduling

How Do Fair Decisions Fare in Long-term Qualification?

2020-10-21 · NeurIPS 2020 12 · Xueru Zhang, Ruibo Tu, Yang Liu, Mingyan Liu 외

Although many fairness criteria have been proposed for decision making, their long-term impact on the well-being of a population remains unclear. In this work, we study the dynamics of population qualification and algori…

Decision MakingFairness

Unintended Selection: Persistent Qualification Rate Disparities and Interventions

2021-11-01 · NeurIPS 2021 12 · Reilly Raab, Yang Liu

Realistically -- and equitably -- modeling the dynamics of group-level disparities in machine learning remains an open problem. In particular, we desire models that do not suppose inherent differences between artificial …

Binary ClassificationCredit scoreFairness