Searcharxiv⌕ Search

arXiv subjects

Abhishek Roy

Publications and source records attributed to Abhishek Roy.

At least 37 records · Page 2Linked to original sources

Stochastic Optimization Algorithms for Instrumental Variable Regression with Streaming Data

We develop and analyze algorithms for instrumental variable regression by viewing the problem as a conditional stochastic optimization problem. In the context of least-squares instrumental variable regression, our algorithms neither require matrix inversions nor mini-batches and provides a fully online approach for performing instrumental variable regression with streaming data. When the true model is linear, we derive rates of convergence in expectation, that are of order $\mathcal{O}(\log T/T)$ and $\mathcal{O}(1/T^{1-ι})$ for any $ι>0$, respectively under the availability of two-sample and one-sample oracles, respectively, where $T$ is the number of iterations. Importantly, under the availability of the two-sample oracle, our procedure avoids explicitly modeling and estimating the relationship between confounder and the instrumental variables, demonstrating the benefit of the proposed approach over recent works based on reformulating the problem as minimax optimization problems. Numerical experiments are provided to corroborate the theoretical results.

stat.ML↗

A Central Limit Theorem for Algorithmic Estimator of Saddle Point

In this work, we study the asymptotic randomness of an algorithmic estimator of the saddle point of a globally convex-concave and locally strongly-convex strongly-concave objective. Specifically, we show that the averaged iterates of a Stochastic Extra-Gradient (SEG) method for a Saddle Point Problem (SPP) converges almost surely to the saddle point and follows a Central Limit Theorem (CLT) with optimal covariance under martingale-difference noise and the state(decision)-dependent Markov noise. To ensure the stability of the algorithm dynamics under the state-dependent Markov noise, we propose a variant of SEG with truncated varying sets. Interestingly, we show that a state-dependent Markovian data sequence can cause Stochastic Gradient Descent Ascent (SGDA) to diverge even if the target objective is strongly-convex strongly-concave. The main novelty of this work is establishing a CLT for SEG for a stochastic SPP, especially under sate-dependent Markov noise. This is the first step towards online inference of SPP with numerous potential applications including games, robust strategic classification, and reinforcement learning. We illustrate our results through numerical experiments.

math.OC↗

Online covariance estimation for stochastic gradient descent under Markovian sampling

We investigate the online overlapping batch-means covariance estimator for Stochastic Gradient Descent (SGD) under Markovian sampling. Convergence rates of order $O\big(\sqrt{d}\,n^{-1/8}(\log n)^{1/4}\big)$ and $O\big(\sqrt{d}\,n^{-1/8}\big)$ are established under state-dependent and state-independent Markovian sampling, respectively, where $d$ is the dimensionality and $n$ denotes observations or SGD iterations. These rates match the best-known convergence rate for independent and identically distributed (i.i.d) data. Our analysis overcomes significant challenges that arise due to Markovian sampling, leading to the introduction of additional error terms and complex dependencies between the blocks of the batch-means covariance estimator. Moreover, we establish the convergence rate for the first four moments of the $\ell_2$ norm of the error of SGD dynamics under state-dependent Markovian data, which holds potential interest as an independent result. Numerical illustrations provide confidence intervals for SGD in linear and logistic regression models under Markovian sampling. Additionally, our method is applied to the strategic classification with logistic regression, where adversaries adaptively modify features during training to affect target class classification.

math.ST↗

Fermionic Dark Matter in Dynamical Scotogenic Model

In the Dynamical Scotogenic Model, the global $B-L$ symmetry is supposed to be broken spontaneously resulting in a massless Goldstone boson called majoron, and massive right handed neutrinos which participate in the generation of light neutrino massses at one-loop. One of them being the lightest stable particle can be a thermal dark matter candidate. We discuss how the dark matter phenomenology differs from the original Scotogenic model, taking into account all the constraints coming from the observed neutrino masses and mixing, lepton flavor violations such as $μ\to eγ, μ\to e J$, astrophysical and cosmological observations of stellar cooling and $N_{eff}$, as well as collider signatures such as Higgs invisible decays. We find that the dark matter annihilation to majorons plays an important role to produce the right relic abundance.

hep-ph↗

Optimization on Pareto sets: On a theory of multi-objective optimization

In multi-objective optimization, a single decision vector must balance the trade-offs between many objectives. Solutions achieving an optimal trade-off are said to be Pareto optimal: these are decision vectors for which improving any one objective must come at a cost to another. But as the set of Pareto optimal vectors can be very large, we further consider a more practically significant Pareto-constrained optimization problem, where the goal is to optimize a preference function constrained to the Pareto set. We investigate local methods for solving this constrained optimization problem, which poses significant challenges because the constraint set is (i) implicitly defined, and (ii) generally non-convex and non-smooth, even when the objectives are. We define notions of optimality and stationarity, and provide an algorithm with a last-iterate convergence rate of $O(K^{-1/2})$ to stationarity when the objectives are strongly convex and Lipschitz smooth.

math.OC↗

Krylov Complexity in Quantum Field Theory

In this paper, we study the Krylov complexity in quantum field theory and make a connection with the holographic "Complexity equals Volume" conjecture. When Krylov basis matches with Fock basis, for several interesting settings, we observe that the Krylov complexity equals the average particle number showing that complexity scales with volume. Using similar formalism, we compute the Krylov complexity for free scalar field theory and find surprising similarities with holography. We also extend this framework for field theory where an inverted oscillator appears naturally and explore its chaotic behavior.

hep-th↗

Direct Constructions of Multiple Shift Complementary Sets of Flexible Lengths

Golay complementary set (GCS) plays a vital role in reducing peak-to-mean envelope power ratio (PMEPR) in orthogonal frequency division multiplexing (OFDM). A more general version of GCS is a multiple shift complementary set (MSCS), where by relaxing the condition of zero auto-correlation sum throughout all the non-zero time shifts to the integer multiples of some fixed time shift, more sequence sets can be made available. In this paper, we propose direct constructions of MSCSs with flexible and arbitrary lengths and flexible set sizes, by using multivariable functions, which have not been reported before.

cs.IT↗

Fairness Uncertainty Quantification: How certain are you that the model is fair?

Fairness-aware machine learning has garnered significant attention in recent years because of extensive use of machine learning in sensitive applications like judiciary systems. Various heuristics, and optimization frameworks have been proposed to enforce fairness in classification \cite{del2020review} where the later approaches either provides empirical results or provides fairness guarantee for the exact minimizer of the objective function \cite{celis2019classification}. In modern machine learning, Stochastic Gradient Descent (SGD) type algorithms are almost always used as training algorithms implying that the learned model, and consequently, its fairness properties are random. Hence, especially for crucial applications, it is imperative to construct Confidence Interval (CI) for the fairness of the learned model. In this work we provide CI for test unfairness when a group-fairness-aware, specifically, Disparate Impact (DI), and Disparate Mistreatment (DM) aware linear binary classifier is trained using online SGD-type algorithms. We show that asymptotically a Central Limit Theorem holds for the estimated model parameter of both DI and DM-aware models. We provide online multiplier bootstrap method to estimate the asymptotic covariance to construct online CI. To do so, we extend the known theoretical guarantees shown on the consistency of the online bootstrap method for unconstrained SGD to constrained optimization which could be of independent interest. We illustrate our results on synthetic and real datasets.

stat.ML↗

Causality Constraint on Circuit Complexity from $COSMOEFT$

In this article, we investigate the physical implications of the causality constraint via effective sound speed $c_s(\leq 1)$ on Quantum Circuit Complexity(QCC) in the framework of Cosmological Effective Field Theory (COSMOEFT) using the two-mode squeezed quantum states. This COSMOEFT setup is constructed using the St$\ddot{\text{u}}$ckelberg trick with the help of the lowest dimensional operators, which are broken under time diffeomorphism. In this setup, we consider only the contribution from two derivative terms in the background quasi de Sitter metric. Next, we compute the relevant measures of circuit complexity and their cosmological evolution for different $c_s$ by following two different approaches, Nielsen's and Covariance matrix method. Using this setup, we also compute the Von-Neumann and Rényi entropy, which finally establishes an underlying connecting relationship between the entanglement entropy and circuit complexity. Essentially, we study the behaviour of the circuit complexity measures and entanglement entropy with respect to the scale factor and $c_s$ and find various interesting unexplored features within the window, $0.024\leq c_s\leq 1$, which is supported by both causality and cosmological observation. Finally, we also comment on the connection between the circuit complexity, entanglement entropy and equilibrium temperature for different $c_s$ lying within the mentioned window.

hep-th↗

Circuit Complexity in $\mathcal{Z}_{2}$ ${\cal EEFT}$

Motivated by recent studies of circuit complexity in weakly interacting scalar field theory, we explore the computation of circuit complexity in $\mathcal{Z}_2$ Even Effective Field Theories ($\mathcal{Z}_2$ EEFTs). We consider a massive free field theory with higher-order Wilsonian operators such as $ϕ^{4}$, $ϕ^{6}$ and $ϕ^8.$ To facilitate our computation we regularize the theory by putting it on a lattice. First, we consider a simple case of two oscillators and later generalize the results to $N$ oscillators. The study has been carried out for nearly Gaussian states. In our computation, the reference state is an approximately Gaussian unentangled state, and the corresponding target state, calculated from our theory, is an approximately Gaussian entangled state. We compute the complexity using the geometric approach developed by Nielsen, parameterizing the path ordered unitary transformation and minimizing the geodesic in the space of unitaries. The contribution of higher-order operators, to the circuit complexity, in our theory has been discussed. We also explore the dependency of complexity with other parameters in our theory for various cases.

hep-th↗

WIMP and FIMP Dark Matter in Singlet-Triplet Fermionic Model

We present an extension of the SM involving three triplet fermions, one triplet scalar and one singlet fermion, which can explain both neutrino masses and dark matter. One triplet of fermions and the singlet are odd under a $Z_2$ symmetry, thus the model features two possible dark matter candidates. The two remaining $Z_2$-even triplet fermions can reproduce the neutrino masses and oscillation parameters consistent with observations. We consider the case where the singlet has feeble couplings while the triplet is weakly interacting and investigate the different possibilities for reproducing the observed dark matter relic density. This includes production of the triplet WIMP from freeze-out and from decay of the singlet as well as freeze-in production of the singlet from decay of particles that belong to the thermal bath or are thermally decoupled. While freeze-in production is usually dominated by decay processes, we also show cases where the annihilation of bath particles give substantial contribution to the final relic density. This occurs when the new scalars are below the TeV scale, thus in the reach of the LHC. The next-to-lightest odd particle can be long-lived and can alter the successful BBN predictions for the abundance of light elements, these constraints are relevant in both the scenarios where the singlet or the triplet are the long-lived particle. In the case where the triplet is the DM, the model is subject to constraints from ongoing direct, indirect and collider experiments. When the singlet is the DM, the triplet which is the next-to-lightest odd particle can be long-lived and can be probed at the proposed MATHUSLA detector. Finally we also address the detection prospects of triplet fermions and scalars at the LHC.

hep-ph↗

Sketch2FullStack: Generating Skeleton Code of Full Stack Website and Application from Sketch using Deep Learning and Computer Vision

For a full-stack web or app development, it requires a software firm or more specifically a team of experienced developers to contribute a large portion of their time and resources to design the website and then convert it to code. As a result, the efficiency of the development team is significantly reduced when it comes to converting UI wireframes and database schemas into an actual working system. It would save valuable resources and fasten the overall workflow if the clients or developers can automate this process of converting the pre-made full-stack website design to get a partially working if not fully working code. In this paper, we present a novel approach of generating the skeleton code from sketched images using Deep Learning and Computer Vision approaches. The dataset for training are first-hand sketched images of low fidelity wireframes, database schemas and class diagrams. The approach consists of three parts. First, the front-end or UI elements detection and extraction from custom-made UI wireframes. Second, individual database table creation from schema designs and lastly, creating a class file from class diagrams.

cs.CV↗

Constrained Stochastic Nonconvex Optimization with State-dependent Markov Data

We study stochastic optimization algorithms for constrained nonconvex stochastic optimization problems with Markovian data. In particular, we focus on the case when the transition kernel of the Markov chain is state-dependent. Such stochastic optimization problems arise in various machine learning problems including strategic classification and reinforcement learning. For this problem, we study both projection-based and projection-free algorithms. In both cases, we establish that the number of calls to the stochastic first-order oracle to obtain an appropriately defined $ε$-stationary point is of the order $\mathcal{O}(1/ε^{2.5})$. In the projection-free setting we additionally establish that the number of calls to the linear minimization oracle is of order $\mathcal{O}(1/ε^{5.5})$. We also empirically demonstrate the performance of our algorithm on the problem of strategic classification with neural networks.

math.OC↗

Four-mode squeezed states in de Sitter space: A study with two field interacting quantum system

In this paper we study the application of four-mode squeezed states in the cosmological context, studying two weakly coupled scalar fields in the planar patch of the de Sitter space. We construct the four-mode squeezed state formalism and connect this concept with the Hamiltonian of the two coupled inverted harmonic oscillators having a time-dependent effective frequency in the planar patch of the de Sitter space. Further, the corresponding evolution operator for the quantum Euclidean vacuum state has been constructed, which captures its dynamics. Using the Heisenberg picture coupled differential equations describing the time evolution for all squeezing parameters (amplitude, phase and angle) have been obtained, for the weakly coupled two scalar field model. With the help of these evolutions for the coupled system, we simulate the dynamics of the squeezing parameters in terms of conformal time. From our analysis, we observe interesting dynamics, which helps us to explore various underlying physical implications of the weakly coupled two scalar field system in the planar patch of the de Sitter cosmological background.

gr-qc↗

Plagiarism Detection in the Bengali Language: A Text Similarity-Based Approach

Plagiarism means taking another person's work and not giving any credit to them for it. Plagiarism is one of the most serious problems in academia and among researchers. Even though there are multiple tools available to detect plagiarism in a document but most of them are domain-specific and designed to work in English texts, but plagiarism is not limited to a single language only. Bengali is the most widely spoken language of Bangladesh and the second most spoken language in India with 300 million native speakers and 37 million second-language speakers. Plagiarism detection requires a large corpus for comparison. Bengali Literature has a history of 1300 years. Hence most Bengali Literature books are not yet digitalized properly. As there was no such corpus present for our purpose so we have collected Bengali Literature books from the National Digital Library of India and with a comprehensive methodology extracted texts from it and constructed our corpus. Our experimental results find out average accuracy between 72.10 % - 79.89 % in text extraction using OCR. Levenshtein Distance algorithm is used for determining Plagiarism. We have built a web application for end-user and successfully tested it for Plagiarism detection in Bengali texts. In future, we aim to construct a corpus with more books for more accurate detection.

cs.CL↗

Entanglement in interacting quenched two-body coupled oscillator system

In this work, we explore the effects of a quantum quench on the entanglement measures of a two-body coupled oscillator system having quartic interaction. We use the invariant operator method, under a perturbative framework, for computing the ground state of this system. We give the analytical expressions for the total and reduced density matrix of the system having non-Gaussian, quartic interaction terms. Using this reduced density matrix, we show the analytical calculation of two entanglement measures viz., Von Neumann entanglement entropy using replica trick and Renyi entanglement entropy. Further, we give a numerical estimate of these entanglement measures with respect to the dimensionless parameter $(t/δt$) and show its behaviour in the three regimes, i.e; late time behaviour, around the quench point and the early time behaviour. We comment on the variation of these entanglement measures for different orders of coupling strength. The variation of Renyi entropy of different orders has also been discussed.

hep-th↗

Intelligent Ranking for Dynamic Restoration in Next Generation Wireless Networks

Emerging 5G and next generation 6G wireless are likely to involve myriads of connectivity, consisting of a huge number of relatively smaller cells providing ultra-dense coverage. Guaranteeing seamless connectivity and service level agreements in such a dense wireless system demands efficient network management and fast service recovery. However, restoration of a wireless network, in terms of maximizing service recovery, typically requires evaluating the service impact of every network element. Unfortunately, unavailability of real-time KPI information, during an outage, enforces most of the existing approaches to rely significantly on context-based manual evaluation. As a consequence, configuring a real-time recovery of the network nodes is almost impossible, thereby resulting in a prolonged outage duration. In this article, we explore deep learning to introduce an intelligent, proactive network recovery management scheme in anticipation of an eminent network outage. Our proposed method introduces a novel utilization-based ranking scheme of different wireless nodes to minimize the service downtime and enable a fast recovery. Efficient prediction of network KPI (Key Performance Index), based on actual wireless data demonstrates up to ~54% improvement in service outage.

cs.NI↗

Secluded Dark Matter in Gauged $B-L$ Model

We consider the gauged $B-L$ model which is extended with a secluded dark sector, comprising of two dark sector particles. In this framework the lightest $\mathcal{Z}_2$-odd particle is the dark matter candidate, having a feeble interaction with all other SM and BSM states. The next-to-lightest $\mathcal{Z}_2$-odd particle in the dark sector is a super-wimp, with large interaction strength with the SM and BSM states. We analyse all the relevant production processes that contribute to the dark matter relic abundance, and broadly classify them in two different scenarios, a) dark matter is primarily produced via the non-thermal production process, b) dark matter is produced mostly from the late decay of the next-to-lightest $\mathcal{Z}_2$-odd particle. We discuss the dependency of the relic abundance of the dark matter on various model parameters. Furthermore, we also analyse the discovery prospect of the BSM Higgs via invisible Higgs decay searches.

hep-ph↗