Zobrazeno 1 - 10
of 191
pro vyhledávání: '"Dash, Sanjeeb"'
Model explainability is crucial for human users to be able to interpret how a proposed classifier assigns labels to data based on its feature values. We study generalized linear models constructed using sets of feature value rules, which can capture
Externí odkaz:
http://arxiv.org/abs/2311.01994
The discovery of scientific formulae that parsimoniously explain natural phenomena and align with existing background theory is a key goal in science. Historically, scientists have derived natural laws by manipulating equations based on existing know
Externí odkaz:
http://arxiv.org/abs/2308.09474
Autor:
Clarkson, Kenneth L., Cornelio, Cristina, Dash, Sanjeeb, Goncalves, Joao, Horesh, Lior, Megiddo, Nimrod
This study concerns the formulation and application of Bayesian optimal experimental design to symbolic discovery, which is the inference from observational data of predictive models taking general functional forms. We apply constrained first-order m
Externí odkaz:
http://arxiv.org/abs/2211.15860
Publikováno v:
Journal of Machine Learning Research 2023 Volume 24, Number 229, Pages 1-50
This paper considers the learning of Boolean rules in disjunctive normal form (DNF, OR-of-ANDs, equivalent to decision rule sets) as an interpretable model for classification. An integer program is formulated to optimally trade classification accurac
Externí odkaz:
http://arxiv.org/abs/2111.08466
Autor:
Dash, Sanjeeb, Goncalves, Joao
We present a simple linear programming (LP) based method to learn compact and interpretable sets of rules encoding the facts in a knowledge graph (KG) and use these rules to solve the KG completion problem. Our LP model chooses a set of rules of boun
Externí odkaz:
http://arxiv.org/abs/2110.08245
Autor:
Dash, Sanjeeb, Dubey, Yatharth
In this paper we study the rank of polytopes contained in the 0-1 cube with respect to $t$-branch split cuts and $t$-dimensional lattice cuts for a fixed positive integer $t$. These inequalities are the same as split cuts when $t=1$ and generalize sp
Externí odkaz:
http://arxiv.org/abs/2110.04344
Autor:
Cornelio, Cristina, Dash, Sanjeeb, Austel, Vernon, Josephson, Tyler, Goncalves, Joao, Clarkson, Kenneth, Megiddo, Nimrod, Khadir, Bachir El, Horesh, Lior
Scientists have long aimed to discover meaningful formulae which accurately describe experimental data. A common approach is to manually create mathematical models of natural phenomena using domain knowledge, and then fit these models to data. In con
Externí odkaz:
http://arxiv.org/abs/2109.01634
Binary polynomial optimization is equivalent to the problem of minimizing a linear function over the intersection of the multilinear set with a polyhedron. Many families of valid inequalities for the multilinear set are available in the literature, t
Externí odkaz:
http://arxiv.org/abs/2105.10771
Autor:
Dash, Sanjeeb, Dubey, Yatharth
Publikováno v:
In Discrete Optimization February 2024 51
The problem of finding an ancestral acyclic directed mixed graph (ADMG) that represents the causal relationships between a set of variables is an important area of research on causal inference. Most existing score-based structure learning methods foc
Externí odkaz:
http://arxiv.org/abs/2102.03129