Catalog footprint

What is connected

17works
21topics
4close collaborators

Actions

Connect this record

Log in to claim

Research graph

See the researcher in context

Open full explorer

Inspect adjacent papers, topics, institutions and collaborators without losing the researcher page.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Published work

17 published item(s)

preprint2026arXiv

Learning Long-Term Temporal Dependencies in Photovoltaic Power Output Prediction Through Multi-Horizon Forecasting

The rapid global expansion of solar photovoltaic (PV) capacity-reaching a record 597 GW in 2024-highlights the urgent need for robust forecasting models to mitigate the grid instability caused by the intermittent nature of solar irradiance. While deep learning-based direct forecasting using ground-based sky images (GSI) has emerged as a dominant approach, existing literature is often constrained by single-architecture evaluations and an exclusive focus on single-horizon (point) prediction. This paper proposes a transition from traditional single-horizon estimation toward a multi-horizon forecasting framework, leading to an architecture-independent improvement in accuracy. We hypothesize and demonstrate experimentally that joint optimization over a sequence of future values allows deep neural networks to better capture latent inter-step temporal dependencies by avoiding precocious convergence of the network in terms of both weight gradients and filter diversity. Leveraging this architecture-independent improvement that integrates sequential sky imagery with historical PV generation data, we evaluate the models' abilities to predict power output across multiple discrete future time steps simultaneously. Our methodology is validated through a comparative analysis across diverse deep learning architectures. The results demonstrate that this multi-horizon approach significantly enhances predictive accuracy and robustness across the entire forecast horizon while maintaining computational parsimony. By achieving superior performance with negligible overhead compared to single-horizon models, this work provides a scalable and efficient solution to improve the resilience of modern power grids.

preprint2022arXiv

Effective Electronic Structure of Monoclinic $β-(Al_xGa_{1-x})_2O_3$ alloy semiconductor

In this article, the electronic band structure $β-(Al_xGa_{1-x})_2O_3$ alloy system is calculated with $β-Ga_2O_3$ as the bulk crystal. The technique of band unfolding is implemented to obtain the effective bandstructure \textit{(EBS)} for aluminium fractions varying between 12.5\% and 62.5\% with respect to the gallium atoms. A 160 atom supercell is used to model the disordered system that is generated using the technique of special quasirandom structures which mimics the site correlation of a truly random alloy and reduces the configurational space that arises due to the vast enumeration of alloy occupation sites. The impact of the disorder is then evaluated on the electron effective mass and bandgap which is calculated under the generalized gradient approximation \textit{(GGA)}. The EBS of disordered systems gives an insight into the effect of the loss of translational symmetry on the band topology which manifests as band broadening and can be used to evaluate disorder induced scattering rates and electron lifetimes. This technique of band unfolding can be further extended to alloy phonon dispersion and subsequently phonon lifetimes can also be evaluated from the band broadening.

preprint2022arXiv

Near-Infrared Depth-Independent Image Dehazing using Haar Wavelets

We propose a fusion algorithm for haze removal that combines color information from an RGB image and edge information extracted from its corresponding NIR image using Haar wavelets. The proposed algorithm is based on the key observation that NIR edge features are more prominent in the hazy regions of the image than the RGB edge features in those same regions. To combine the color and edge information, we introduce a haze-weight map which proportionately distributes the color and edge information during the fusion process. Because NIR images are, intrinsically, nearly haze-free, our work makes no assumptions like existing works that rely on a scattering model and essentially designing a depth-independent method. This helps in minimizing artifacts and gives a more realistic sense to the restored haze-free image. Extensive experiments show that the proposed algorithm is both qualitatively and quantitatively better on several key metrics when compared to existing state-of-the-art methods.

preprint2022arXiv

Nonlinear Optical Limiting with Hybrid Nanostructures of NiCo2O4 and Multiwall Carbon Nanotubes

Nonlinear optical (NLO) response in terms of reverse saturable absorption (RSA) has been exploited extensively for optical limiting. Here, we experimentally demonstrate that flower-like hybrid nanostructures of NiCo2O4 and Multiwall Carbon Nanotubes (NCO@MWCNT) exhibit a strong non-linearity in their absorption, specifically an excited state absorption (ESA) induced RSA, when exposed to nanosecond laser pulses. We obtain strong nonlinear absorption coefficient (\b{eta}) and nonlinear refractive index (n2) in hybrid NCO@MWCNT, the values that are 2-times and 2-orders of magnitude higher, respectively compared to NCO or MWCNT alone. This offers straightforward application in optical limiting with optical limiting (FOL) and optical onset (FON) threshold ca. 2-10 times lower than benchmark NLO materials, e.g., graphene, family of 2-D transition metal dichalcogenides (TMDC) materials and recently established NCO. Notably, for femtosecond pumping, NLO response of NCO@MWCNT is dominated by saturable absorption (SA) with a week contribution from two photon absorption (TPA), arising respectively from MWCNT and NCO. A remarkable sign reversal along with a larger amplitude is obtained for n2 thanks to the charge transfer from MWCNT to NCO.

preprint2021arXiv

MetaCI: Meta-Learning for Causal Inference in a Heterogeneous Population

Performing inference on data obtained through observational studies is becoming extremely relevant due to the widespread availability of data in fields such as healthcare, education, retail, etc. Furthermore, this data is accrued from multiple homogeneous subgroups of a heterogeneous population, and hence, generalizing the inference mechanism over such data is essential. We propose the MetaCI framework with the goal of answering counterfactual questions in the context of causal inference (CI), where the factual observations are obtained from several homogeneous subgroups. While the CI network is designed to generalize from factual to counterfactual distribution in order to tackle covariate shift, MetaCI employs the meta-learning paradigm to tackle the shift in data distributions between training and test phase due to the presence of heterogeneity in the population, and due to drifts in the target distribution, also known as concept shift. We benchmark the performance of the MetaCI algorithm using the mean absolute percentage error over the average treatment effect as the metric, and demonstrate that meta initialization has significant gains compared to randomly initialized networks, and other methods.

preprint2020arXiv

CCA: Exploring the Possibility of Contextual Camouflage Attack on Object Detection

Deep neural network based object detection hasbecome the cornerstone of many real-world applications. Alongwith this success comes concerns about its vulnerability tomalicious attacks. To gain more insight into this issue, we proposea contextual camouflage attack (CCA for short) algorithm to in-fluence the performance of object detectors. In this paper, we usean evolutionary search strategy and adversarial machine learningin interactions with a photo-realistic simulated environment tofind camouflage patterns that are effective over a huge varietyof object locations, camera poses, and lighting conditions. Theproposed camouflages are validated effective to most of the state-of-the-art object detectors.

preprint2020arXiv

Effect of lockdown interventions to control the COVID-19 epidemic in India

The pandemic caused by the novel Coronavirus SARS-CoV2 has been responsible for life threatening health complications, and extreme pressure on healthcare systems. While preventive and definite curative medical interventions are yet to arrive, Non-Pharmaceutical Interventions (NPIs) like physical isolation, quarantine and drastic social measures imposed by governing agencies are effective in arresting the spread of infections in a population. In densely populated countries like India, lockdown interventions are partially effective due to social and administrative complexities. Using detailed demographic data, we present an agent based model to imitate the behavior of the population and its mobility features, even under intervention. We demonstrate the effectiveness of contact tracing policies and how our model efficiently relates to empirical findings on testing efficiency. We also present various lockdown intervention strategies for mitigation - using the bare number of infections, the effective reproduction rate, as well as using reinforcement learning. Our analysis can help assess the socio-economic consequences of such interventions, and provide useful ideas and insights to policy makers for better decision making.

preprint2020arXiv

Fast Griffin Lim based Waveform Generation Strategy for Text-to-Speech Synthesis

The performance of text-to-speech (TTS) systems heavily depends on spectrogram to waveform generation, also known as the speech reconstruction phase. The time required for the same is known as synthesis delay. In this paper, an approach to reduce speech synthesis delay has been proposed. It aims to enhance the TTS systems for real-time applications such as digital assistants, mobile phones, embedded devices, etc. The proposed approach applies Fast Griffin Lim Algorithm (FGLA) instead Griffin Lim algorithm (GLA) as vocoder in the speech synthesis phase. GLA and FGLA are both iterative, but the convergence rate of FGLA is faster than GLA. The proposed approach is tested on LJSpeech, Blizzard and Tatoeba datasets and the results for FGLA are compared against GLA and neural Generative Adversarial Network (GAN) based vocoder. The performance is evaluated based on synthesis delay and speech quality. A 36.58% reduction in speech synthesis delay has been observed. The quality of the output speech has improved, which is advocated by higher Mean opinion scores (MOS) and faster convergence with FGLA as opposed to GLA.

preprint2020arXiv

Low field electron mobility in $α-Ga_{2}O_{3}$: An ab-initio approach

The $α$ phase of $Ga_{2}O_{3}$ is an ultra-wideband semiconductor with potential power electronics applications. In this work, we calculate the low field electron mobility in $α-Ga_{2}O_{3}$ from first principles. The 10 atom unit cell contributes to 30 phonon modes and the effect of each mode is taken into account for the transport calculation. The phonon dispersion and the Raman spectrum are calculated under the density functional perturbation theory formalism and compared with experiments. The IR strength is calculated from the dipole moment at the $Γ$ point of the Brillouin zone. The electron-phonon interaction elements (EPI) on a dense reciprocal space grid is obtained using the Wannier interpolation technique. The polar nature of the material is accounted for by interpolating the non-polar and polar EPI elements independently as the localized nature of the Wannier functions are not suitable for interpolating the long-range polar interaction elements. For polar interaction the full phonon dispersion is taken into account. The electron mobility is then calculated including the polar, non-polar and ionized impurity scattering.

preprint2016arXiv

A Linearization Technique for Self-Interference Cancellation in Full-Duplex Radios

The fundamental problem in the design of a full-duplex radio is the cancellation of the self-interference (SI) signal generated by the transmitter.Current techniques for suppressing SI rely on generating a copy of the SI signal and subtracting it partly in the RF (radio frequency) and digital domains. A critical step in replicating the self-interference is the estimation of the multi-path channel through which the transmitted signal propagates to the antenna. Since there is no prior model on the number of multipath reflections, current techniques assume a tap delay line filter (in the RF and digital domain) with a large number of taps, and estimate the taps in the analog and the digital domain. Assuming such a model leads to a large form-factor for the analog and RF circuits and increased complexity in the digital domain. In this paper, using a linearization technique, we show that the self-interference channel in an indoor environment can be effectively modelled as $H(f)=C_0 + C_1f$ in the frequency domain. Thus, the effective self-interference channel can be represented by two parameters $C_0$ and $C_1$, irrespective of the multipath environment. We also provide experimental evidence to verify the above channel model and propose novel low-complexity designs for self-interference cancellation. Linearization not only aids in the practicality of analog cancellation by reducing the form factor, but also results in a simpler SI filter model in the digital domain due to dimensionality reduction of the channel parameters. Therefore this method can enable the widespread adoption of full-duplex techniques to portable devices in addition to infrastructure base-stations.

preprint2015arXiv

Ignorance is Almost Bliss: Near-Optimal Stochastic Matching With Few Queries

The stochastic matching problem deals with finding a maximum matching in a graph whose edges are unknown but can be accessed via queries. This is a special case of stochastic $k$-set packing, where the problem is to find a maximum packing of sets, each of which exists with some probability. In this paper, we provide edge and set query algorithms for these two problems, respectively, that provably achieve some fraction of the omniscient optimal solution. Our main theoretical result for the stochastic matching (i.e., $2$-set packing) problem is the design of an \emph{adaptive} algorithm that queries only a constant number of edges per vertex and achieves a $(1-ε)$ fraction of the omniscient optimal solution, for an arbitrarily small $ε>0$. Moreover, this adaptive algorithm performs the queries in only a constant number of rounds. We complement this result with a \emph{non-adaptive} (i.e., one round of queries) algorithm that achieves a $(0.5 - ε)$ fraction of the omniscient optimum. We also extend both our results to stochastic $k$-set packing by designing an adaptive algorithm that achieves a $(\frac{2}{k} - ε)$ fraction of the omniscient optimal solution, again with only $O(1)$ queries per element. This guarantee is close to the best known polynomial-time approximation ratio of $\frac{3}{k+1} -ε$ for the \emph{deterministic} $k$-set packing problem [Furer and Yu, 2013] We empirically explore the application of (adaptations of) these algorithms to the kidney exchange problem, where patients with end-stage renal failure swap willing but incompatible donors. We show on both generated data and on real data from the first 169 match runs of the UNOS nationwide kidney exchange that even a very small number of non-adaptive edge queries per vertex results in large gains in expected successful matches.

preprint2015arXiv

Predicting Small Group Accretion in Social Networks: A topology based incremental approach

Small Group evolution has been of central importance in social sciences and also in the industry for understanding dynamics of team formation. While most of research works studying groups deal at a macro level with evolution of arbitrary size communities, in this paper we restrict ourselves to studying evolution of small group (size $\leq20$) which is governed by contrasting sociological phenomenon. Given a previous history of group collaboration between a set of actors, we address the problem of predicting likely future group collaborations. Unfortunately, predicting groups requires choosing from $n \choose r$ possibilities (where $r$ is group size and $n$ is total number of actors), which becomes computationally intractable as group size increases. However, our statistical analysis of a real world dataset has shown that two processes: an external actor joining an existing group (incremental accretion (IA)) or collaborating with a subset of actors of an exiting group (subgroup accretion (SA)), are largely responsible for future group formation. This helps to drastically reduce the $n\choose r$ possibilities. We therefore, model the attachment of a group for different actors outside this group. In this paper, we have built three topology based prediction models to study these phenomena. The performance of these models is evaluated using extensive experiments over DBLP dataset. Our prediction results shows that the proposed models are significantly useful for future group predictions both for IA and SA.

preprint2014arXiv

Multiway Cut, Pairwise Realizable Distributions, and Descending Thresholds

We design new approximation algorithms for the Multiway Cut problem, improving the previously known factor of 1.32388 [Buchbinder et al., 2013]. We proceed in three steps. First, we analyze the rounding scheme of Buchbinder et al., 2013 and design a modification that improves the approximation to (3+sqrt(5))/4 (approximately 1.309017). We also present a tight example showing that this is the best approximation one can achieve with the type of cuts considered by Buchbinder et al., 2013: (1) partitioning by exponential clocks, and (2) single-coordinate cuts with equal thresholds. Then, we prove that this factor can be improved by introducing a new rounding scheme: (3) single-coordinate cuts with descending thresholds. By combining these three schemes, we design an algorithm that achieves a factor of (10 + 4 sqrt(3))/13 (approximately 1.30217). This is the best approximation factor that we are able to verify by hand. Finally, we show that by combining these three rounding schemes with the scheme of independent thresholds from Karger et al., 2004, the approximation factor can be further improved to 1.2965. This approximation factor has been verified only by computer.

preprint2014arXiv

Predicting Multi-actor collaborations using Hypergraphs

Social networks are now ubiquitous and most of them contain interactions involving multiple actors (groups) like author collaborations, teams or emails in an organizations, etc. Hypergraphs are natural structures to effectively capture multi-actor interactions which conventional dyadic graphs fail to capture. In this work the problem of predicting collaborations is addressed while modeling the collaboration network as a hypergraph network. The problem of predicting future multi-actor collaboration is mapped to hyperedge prediction problem. Given that the higher order edge prediction is an inherently hard problem, in this work we restrict to the task of predicting edges (collaborations) that have already been observed in past. In this work, we propose a novel use of hyperincidence temporal tensors to capture time varying hypergraphs and provides a tensor decomposition based prediction algorithm. We quantitatively compare the performance of the hypergraphs based approach with the conventional dyadic graph based approach. Our hypothesis that hypergraphs preserve the information that simple graphs destroy is corroborated by experiments using author collaboration network from the DBLP dataset. Our results demonstrate the strength of hypergraph based approach to predict higher order collaborations (size>4) which is very difficult using dyadic graph based approach. Moreover, while predicting collaborations of size>2 hypergraphs in most cases provide better results with an average increase of approx. 45% in F-Score for different sizes = {3,4,5,6,7}.

preprint2014arXiv

Privacy-Preserving Public Information for Sequential Games

In settings with incomplete information, players can find it difficult to coordinate to find states with good social welfare. For example, in financial settings, if a collection of financial firms have limited information about each other's strategies, some large number of them may choose the same high-risk investment in hopes of high returns. While this might be acceptable in some cases, the economy can be hurt badly if many firms make investments in the same risky market segment and it fails. One reason why many firms might end up choosing the same segment is that they do not have information about other firms' investments (imperfect information may lead to `bad' game states). Directly reporting all players' investments, however, raises confidentiality concerns for both individuals and institutions. In this paper, we explore whether information about the game-state can be publicly announced in a manner that maintains the privacy of the actions of the players, and still suffices to deter players from reaching bad game-states. We show that in many games of interest, it is possible for players to avoid these bad states with the help of privacy-preserving, publicly-announced information. We model behavior of players in this imperfect information setting in two ways -- greedy and undominated strategic behaviours, and we prove guarantees on social welfare that certain kinds of privacy-preserving information can help attain. Furthermore, we design a counter with improved privacy guarantees under continual observation.

preprint2013arXiv

On the Approximation of Submodular Functions

Submodular functions are a fundamental object of study in combinatorial optimization, economics, machine learning, etc. and exhibit a rich combinatorial structure. Many subclasses of submodular functions have also been well studied and these subclasses widely vary in their complexity. Our motivation is to understand the relative complexity of these classes of functions. Towards this, we consider the question of how well can one class of submodular functions be approximated by another (simpler) class of submodular functions. Such approximations naturally allow algorithms designed for the simpler class to be applied to the bigger class of functions. We prove both upper and lower bounds on such approximations. Our main results are: 1. General submodular functions can be approximated by cut functions of directed graphs to a factor of $n^2/4$, which is tight. 2. General symmetric submodular functions$^{1}$ can be approximated by cut functions of undirected graphs to a factor of $n-1$, which is tight up to a constant. 3. Budgeted additive functions can be approximated by coverage functions to a factor of $e/(e-1)$, which is tight. Here $n$ is the size of the ground set on which the submodular function is defined. We also observe that prior works imply that monotone submodular functions can be approximated by coverage functions with a factor between $O(\sqrt{n} \log n)$ and $Ω(n^{1/3} /\log^2 n) $.

preprint2011arXiv

Welfare and Profit Maximization with Production Costs

Combinatorial Auctions are a central problem in Algorithmic Mechanism Design: pricing and allocating goods to buyers with complex preferences in order to maximize some desired objective (e.g., social welfare, revenue, or profit). The problem has been well-studied in the case of limited supply (one copy of each item), and in the case of digital goods (the seller can produce additional copies at no cost). Yet in the case of resources---oil, labor, computing cycles, etc.---neither of these abstractions is just right: additional supplies of these resources can be found, but at increasing difficulty (marginal cost) as resources are depleted. In this work, we initiate the study of the algorithmic mechanism design problem of combinatorial pricing under increasing marginal cost. The goal is to sell these goods to buyers with unknown and arbitrary combinatorial valuation functions to maximize either the social welfare, or the seller's profit; specifically we focus on the setting of \emph{posted item prices} with buyers arriving online. We give algorithms that achieve {\em constant factor} approximations for a class of natural cost functions---linear, low-degree polynomial, logarithmic---and that give logarithmic approximations for more general increasing marginal cost functions (along with a necessary additive loss). We show that these bounds are essentially best possible for these settings.