arXiv subjects

Aditya Anand

Publications and source records attributed to Aditya Anand.

21 records · Page 2Linked to original sources

arXiv2022

A wavelet-based detector function for characterizing intermittent velocity signals

In this work, we propose a new detector function based on wavelet transform to discriminate between turbulent and non-turbulent regions in an intermittent velocity signal. The derivative-based detector function, which is commonly used in intermittency calculation schemes, shows large fluctuations within turbulent parts of the signal and requires averaging over a certain ``smoothing period'' to remove the fake drop-outs, introducing subjectivity in calculating intermittency. The new detector function proposed here is obtained by averaging the ``pre-multiplied wavelet energy'' over the entire frequency range, resulting in a function that is much smoother than the derivative-based detector and at the same time has a good discriminatory property. This makes the choice of the smoothing period unnecessary and removes the subjectivity associated with it. We demonstrate the effectiveness of the wavelet detector within the framework of the widely-used method by Hedley and Keffer (1974, J. Fluid Mech., V64, pp625), for a range of velocity signals representing the different stages of roughness-induced transition. The wavelet detector function works well in detecting the edge intermittency of a canonical turbulent boundary layer as well, thereby highlighting its generality. Our detector can, in principle, be used with any method of specifying threshold for obtaining an indicator function.

physics.flu-dyn↗

arXiv2020

Split: Inferring Unobserved Event Probabilities for Disentangling Brand-Customer Interactions

Often, data contains only composite events composed of multiple events, some observed and some unobserved. For example, search ad click is observed by a brand, whereas which customers were shown a search ad - an actionable variable - is often not observed. In such cases, inference is not possible on unobserved event. This occurs when a marketing action is taken over earned and paid digital channels. Similar setting arises in numerous datasets where multiple actors interact. One approach is to use the composite event as a proxy for the unobserved event of interest. However, this leads to invalid inference. This paper takes a direct approach whereby an event of interest is identified based on information on the composite event and aggregate data on composite events (e.g. total number of search ads shown). This work contributes to the literature by proving identification of the unobserved events' probabilities up to a scalar factor under mild condition. We propose an approach to identify the scalar factor by using aggregate data that is usually available from earned and paid channels. The factor is identified by adding a loss term to the usual cross-entropy loss. We validate the approach on three synthetic datasets. In addition, the approach is validated on a real marketing problem where some observed events are hidden from the algorithm for validation. The proposed modification to the cross-entropy loss function improves the average performance by 46%.

cs.LG↗

arXiv2020

Distance Restricted Manipulation in Voting

We introduce the notion of {\em Distance Restricted Manipulation}, where colluding manipulator(s) need to compute if there exist votes which make their preferred alternative win the election when their knowledge about the others' votes is a little inaccurate. We use the Kendall-Tau distance to model the manipulators' confidence in the non-manipulators' votes. To this end, we study this problem in two settings - one where the manipulators need to compute a manipulating vote that succeeds irrespective of perturbations in others' votes ({\em Distance Restricted Strong Manipulation}), and the second where the manipulators need to compute a manipulating vote that succeeds for at least one possible vote profile of the others ({\em Distance Restricted Weak Manipulation}). We show that {\em Distance Restricted Strong Manipulation} admits polynomial-time algorithms for every scoring rule, maximin, Bucklin, and simplified Bucklin voting rules for a single manipulator, and for the $k$-approval rule for any number of manipulators, but becomes intractable for the Copeland$^α$ voting rule for every $α\in[0,1]$ even for a single manipulator. In contrast, {\em Distance Restricted Weak Manipulation} is intractable for almost all the common voting rules, with the exception of the plurality rule. For a constant number of alternatives, we show that both the problems are polynomial-time solvable for every anonymous and efficient voting rule.

cs.GT↗