SearcharxivSearch

arXiv subjects

Deep Mukhopadhyay

Publications and source records attributed to Deep Mukhopadhyay.

2 recordsLinked to original sources

Abductive Inference and C. S. Peirce: 150 Years Later

This paper is about two things: (i) Charles Sanders Peirce (1837-1914) -- an iconoclastic philosopher and polymath who is among the greatest of American minds. (ii) Abductive inference -- a term coined by C. S. Peirce, which he defined as "the process of forming explanatory hypotheses. It is the only logical operation which introduces any new idea." Abductive inference and quantitative economics: Abductive inference plays a fundamental role in empirical scientific research as a tool for discovery and data analysis. Heckman and Singer (2017) strongly advocated "Economists should abduct." Arnold Zellner (2007) stressed that "much greater emphasis on reductive [abductive] inference in teaching econometrics, statistics, and economics would be desirable." But currently, there are no established theory or practical tools that can allow an empirical analyst to abduct. This paper attempts to fill this gap by introducing new principles and concrete procedures to the Economics and Statistics community. I termed the proposed approach as Abductive Inference Machine (AIM). The historical Peirce's experiment: In 1872, Peirce conducted a series of experiments to determine the distribution of response times to an auditory stimulus, which is widely regarded as one of the most significant statistical investigations in the history of nineteenth-century American mathematical research (Stigler, 1978). On the 150th anniversary of this historical experiment, we look back at the Peircean-style abductive inference through a modern statistical lens. Using Peirce's data, it is shown how empirical analysts can abduct in a systematic and automated manner using AIM.

econ.EM

A Class of $(n, k, r, t)_i$ LRCs Via Parity Check Matrix

A code is called $(n, k, r, t)$ information symbol locally repairable code \big($(n, k, r, t)_i$ LRC\big) if each information coordinate can be achieved by at least $t$ disjoint repair sets, containing at most $r$ other coordinates. This paper considers a class of $(n, k, r, t)_i$ LRCs, where each repair set contains exactly one parity coordinate. We explore the systematic code in terms of the standard parity check matrix. First, some structural features of the parity check matrix are proposed by showing some connections with the membership matrix and the minimum distance optimality of the code. Next to that, parity check matrix based proofs of various bounds associated with the code are placed. In addition to this, we provide several constructions of optimal $(n, k, r, t)_i$ LRCs, with the help of two Cayley tables of a finite field. Finally, we generalize a result of $q$-ary $(n, k, r)$ LRCs to $q$-ary $(n, k, r, t)$ LRCs.

cs.IT