Name
Abstract | ||
|---|---|---|
Set functions predict a label from a permutation-invariant variable-size collection of feature vectors. We propose making set functions more understandable and regularized by capturing domain knowledge through shape constraints. We show how prior work in monotonic constraints can be adapted to set functions, and then propose two new shape constraints designed to generalize the conditioning role of weights in a weighted mean. We show how one can train standard functions and set functions that satisfy these shape constraints with a deep lattice network. We propose a nonlinear estimation strategy we call the semantic feature engine that uses set functions with the proposed shape constraints to estimate labels for compound sparse categorical features. Experiments on real-world data show the achieved accuracy is similar to deep sets or deep neural networks, but provides guarantees on the model behavior, which makes it easier to explain and debug. |
Year | Venue | Field |
|---|---|---|
2019 | international conference on machine learning | Set function,Pattern recognition,Computer science,Artificial intelligence |
DocType | Citations | PageRank |
Conference | 1 | 0.35 |
References | Authors | |
0 | 8 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Andrew Cotter | 1 | 851 | 78.35 |
| Maya R. Gupta | 2 | 595 | 49.62 |
| Heinrich Jiang | 3 | 32 | 9.45 |
| Erez Louidor | 4 | 2 | 1.84 |
| James Muller | 5 | 1 | 0.68 |
| Tamann Narayan | 6 | 1 | 0.35 |
| Serena Wang | 7 | 4 | 4.09 |
| Tao Zhu | 8 | 58 | 12.63 |