Search

Versatile Video Coding (VVC) allows for large compression efficiency gains over its predecessor, High Efficiency Video Coding (HEVC). The added efficiency comes at the cost of increased runtime complexity, especially for encoding. It is thus highly relevant to explore all available runtime reduction options. This paper proposes a novel first pass for two-pass rate control in all-intra configuration, using low-complexity video analysis and a Random Forest (RF)-based machine learning model to derive the data required for driving the second pass. The proposed method is validated using VVenC, an open and optimized VVC encoder. Compared to the default two-pass rate control algorithm in VVenC, the proposed method achieves around 32% reduction in encoding time for the preset faster, while on average only causing 2% BD-rate increase and achieving similar rate control accuracy., Comment: Accepted in IEEE International Conference on Image Processing (ICIP), 2023

The security of computer systems typically relies on a hardware root of trust. As vulnerabilities in hardware can have severe implications on a system, there is a need for techniques to support security verification activities. Assertion-based verification is a popular verification technique that involves capturing design intent in a set of assertions that can be used in formal verification or testing-based checking. However, writing security-centric assertions is a challenging task. In this work, we investigate the use of emerging large language models (LLMs) for code generation in hardware assertion generation for security, where primarily natural language prompts, such as those one would see as code comments in assertion files, are used to produce SystemVerilog assertions. We focus our attention on a popular LLM and characterize its ability to write assertions out of the box, given varying levels of detail in the prompt. We design an evaluation framework that generates a variety of prompts, and we create a benchmark suite comprising real-world hardware designs and corresponding golden reference assertions that we want to generate with the LLM., Comment: This article has been accepted for publication in IEEE Transactions on Information Forensics and Security. This is the author's version. See https://ieeexplore.ieee.org/document/10458667 for the published version of the paper. Citation information: DOI 10.1109/TIFS.2024.3372809. See https://www.ieee.org/publications/rights/index.html for information on publication rights

Hardware intellectual property (IP) piracy is an emerging threat to the global supply chain. Correspondingly, various countermeasures aim to protect hardware IPs, such as logic locking, camouflaging, and split manufacturing. However, these countermeasures cannot always guarantee IP security. A malicious attacker can access the layout/netlist of the hardware IP protected by these countermeasures and further retrieve the design. To eliminate/bypass these vulnerabilities, a recent approach redacts the design's IP to an embedded field-programmable gate array (eFPGA), disabling the attacker's access to the layout/netlist. eFPGAs can be programmed with arbitrary functionality. Without the bitstream, the attacker cannot recover the functionality of the protected IP. Consequently, state-of-the-art attacks are inapplicable to pirate the redacted hardware IP. In this paper, we challenge the assumed security of eFPGA-based redaction. We present an attack to retrieve the hardware IP with only black-box access to a programmed eFPGA. We observe the effect of modern electronic design automation (EDA) tools on practical hardware circuits and leverage the observation to guide our attack. Thus, our proposed method FuncTeller selects minterms to query, recovering the circuit function within a reasonable time. We demonstrate the effectiveness and efficiency of FuncTeller on multiple circuits, including academic benchmark circuits, Stanford MIPS processor, IBEX processor, Common Evaluation Platform GPS, and Cybersecurity Awareness Worldwide competition circuits. Our results show that FuncTeller achieves an average accuracy greater than 85% over these tested circuits retrieving the design's functionality., Comment: To be published in the proceedings of the 32nd USENIX Security Symposium, 2023

Non-invasive imaging plays a crucial role in diagnosing and studying eye diseases. However, existing photoacoustic ophthalmoscopy (PAOM) techniques in mice have limitations due to handling restrictions, suboptimal optical properties, limited availability of light sources and permissible light fluence at the retina. This study introduces an innovative approach that utilizes Rose Bengal, a contrast agent, to enhance PAOM contrast. This enables visualization of deeper structures like the choroidal microvasculature and sclera in the mouse eye using visible light. The integration of near-infrared-II optical coherence tomography (NIR-II OCT) provides additional tissue contrast and insights into potential NIR-II PAOM capabilities. To optimize imaging, we developed a cost-effective 3D printable mouse eye phantom and a fully 3D printable tip/tilt mouse platform. This solution elevates PAOM to a user-friendly technology, which can be used to address pressing research questions concerning several ocular diseases such as myopia, glaucoma and/or age-related macular degeneration in the future., Comment: 14 pages, 4 figures

We study the problem of learning causal representations from unknown, latent interventions in a general setting, where the latent distribution is Gaussian but the mixing function is completely general. We prove strong identifiability results given unknown single-node interventions, i.e., without having access to the intervention targets. This generalizes prior works which have focused on weaker classes, such as linear maps or paired counterfactual data. This is also the first instance of causal identifiability from non-paired interventions for deep neural network embeddings. Our proof relies on carefully uncovering the high-dimensional geometric structure present in the data distribution after a non-linear density transformation, which we capture by analyzing quadratic forms of precision matrices of the latent distributions. Finally, we propose a contrastive algorithm to identify the latent variables in practice and evaluate its performance on various tasks., Comment: Accepted as Oral paper at NeurIPS 2023

We propose a novel experimental method for probing light dark matter candidates. We show that an electro-optical material's refractive index is modified in the presence of a coherently oscillating dark matter background. A high-precision resonant Michelson interferometer can be used to read out this signal. The proposed detection scheme allows for the exploration of an uncharted parameter space of dark matter candidates over a wide range of masses -- including masses exceeding a few tens of microelectronvolts, which is a challenging parameter space for microwave cavity haloscopes., Comment: 6+4 pages, 2 figures

Machine learning (ML) in healthcare presents numerous opportunities for enhancing patient care, population health, and healthcare providers' workflows. However, the real-world clinical and cost benefits remain limited due to challenges in data privacy, heterogeneous data sources, and the inability to fully leverage multiple data modalities. In this perspective paper, we introduce "patchwork learning" (PL), a novel paradigm that addresses these limitations by integrating information from disparate datasets composed of different data modalities (e.g., clinical free-text, medical images, omics) and distributed across separate and secure sites. PL allows the simultaneous utilization of complementary data sources while preserving data privacy, enabling the development of more holistic and generalizable ML models. We present the concept of patchwork learning and its current implementations in healthcare, exploring the potential opportunities and applicable data sources for addressing various healthcare challenges. PL leverages bridging modalities or overlapping feature spaces across sites to facilitate information sharing and impute missing data, thereby addressing related prediction tasks. We discuss the challenges associated with PL, many of which are shared by federated and multimodal learning, and provide recommendations for future research in this field. By offering a more comprehensive approach to healthcare data integration, patchwork learning has the potential to revolutionize the clinical applicability of ML models. This paradigm promises to strike a balance between personalization and generalizability, ultimately enhancing patient experiences, improving population health, and optimizing healthcare providers' workflows.

In this and a companion paper, we show that quantum field theories with gauge symmetries permit a broader class of classical dynamics than typically assumed. In this article, we show that the dynamics extracted from the path integral or Hamiltonian formulation of general relativity allows for classical states that do not satisfy the full set of Einstein's equations. This amounts to loosening the Hamiltonian and momentum constraints that are imposed on the initial state. Nevertheless, the quantum theory permits gauge invariant time evolution of these states. The time evolution of these states is such that at the classical level the full set of Einstein's equations would appear to hold, with the physical effects of these states being attributable to an auxiliary, covariantly conserved energy-momentum tensor with no internal degrees of freedom. We derive the generalized Einstein equations for these states and show that a homogeneous and isotropic initial background state contributes to expansion identical to cold dark matter. The inhomogeneous components of this state could source curvature perturbations that grow linearly at linear order. This auxiliary contribution to Einstein's equations could have either sign and thus provide a trivial way to violate the null energy condition, enabling novel gravitational dynamics such as cosmic bounces and wormholes., Comment: 21 pages

In video streaming applications, a fixed set of bitrate-resolution pairs (known as a bitrate ladder) is typically used during the entire streaming session. However, an optimized bitrate ladder per scene may result in (i) decreased storage or delivery costs or/and (ii) increased Quality of Experience. This paper introduces a Just Noticeable Difference (JND)-aware per-scene bitrate ladder prediction scheme (JASLA) for adaptive video-on-demand streaming applications. JASLA predicts jointly optimized resolutions and corresponding constant rate factors (CRFs) using spatial and temporal complexity features for a given set of target bitrates for every scene, which yields an efficient constrained Variable Bitrate encoding. Moreover, bitrate-resolution pairs that yield distortion lower than one JND are eliminated. Experimental results show that, on average, JASLA yields bitrate savings of 34.42% and 42.67% to maintain the same PSNR and VMAF, respectively, compared to the reference HTTP Live Streaming (HLS) bitrate ladder Constant Bitrate encoding using x265 HEVC encoder, where the maximum resolution of streaming is Full HD (1080p). Moreover, a 54.34% average cumulative decrease in storage space is observed., Comment: 2023 IEEE International Conference on Multimedia and Expo (ICME)

This paper proposes an architecture that integrates neural networks (NNs) and hardware security modules using a single resistive random access memory (RRAM) crossbar. The proposed architecture enables using a single crossbar to implement NN, true random number generator (TRNG), and physical unclonable function (PUF) applications while exploiting the multi-state storage characteristic of the RRAM crossbar for the vector-matrix multiplication operation required for the implementation of NN. The TRNG is implemented by utilizing the crossbar's variation in device switching thresholds to generate random bits. The PUF is implemented using the same crossbar initialized as an entropy source for the TRNG. Additionally, the weights locking concept is introduced to enhance the security of NNs by preventing unauthorized access to the NN weights. The proposed architecture provides flexibility to configure the RRAM device in multiple modes to suit different applications. It shows promise in achieving a more efficient and compact design for the hardware implementation of NNs and security primitives.

We propose a novel search technique for axions with a $CP$-violating monopole coupling $\tilde{g}_Q$ to bulk Standard Model charges $Q \in \{B,L,B-L\}$. Gradients in the static axion field configurations sourced by matter induce achromatic circular photon birefringence via the axion-photon coupling $g_{\phi\gamma}$. Circularly polarized light fed into an optical or (open) radio-frequency (RF) Fabry-P\'erot (FP) cavity develops a phase shift that accumulates up to the cavity finesse: the fixed axion spatial gradient prevents a cancellation known to occur for an axion dark-matter search. The relative phase shift between two FP cavities fed with opposite circular polarizations can be detected interferometrically. This time-independent signal can be modulated up to non-zero frequency by altering the cavity orientations with respect to the field gradient. Multi-wavelength co-metrology techniques can be used to address chromatic measurement systematics and noise sources. With Earth as the axion source, we project reach beyond current constraints on the product of couplings $\tilde{g}_Q g_{\phi\gamma}$ for axion masses $m_{\phi} \lesssim 10^{-5} \mathrm{eV}$. If shot-noise-limited sensitivity can be achieved, an experiment using high-finesse RF FP cavities could reach a factor of $\sim 10^{5}$ into new parameter space for $\tilde{g}_Q g_{\phi\gamma}$ for masses $m_\phi \lesssim 4\times 10^{-11} \mathrm{eV}$., Comment: 9 pages, 2 figures. Published version

Brain-computer interfaces are being explored for a wide variety of therapeutic applications. Typically, this involves measuring and analyzing continuous-time electrical brain activity via techniques such as electrocorticogram (ECoG) or electroencephalography (EEG) to drive external devices. However, due to the inherent noise and variability in the measurements, the analysis of these signals is challenging and requires offline processing with significant computational resources. In this paper, we propose a simple yet efficient machine learning-based approach for the exemplary problem of hand gesture classification based on brain signals. We use a hybrid machine learning approach that uses a convolutional spiking neural network employing a bio-inspired event-driven synaptic plasticity rule for unsupervised feature learning of the measured analog signals encoded in the spike domain. We demonstrate that this approach generalizes to different subjects with both EEG and ECoG data and achieves superior accuracy in the range of 92.74-97.07% in identifying different hand gesture classes and motor imagery tasks., Comment: Accepted at AICAS 2023

In recent years, video streaming applications have proliferated the demand for Video Quality Assessment VQA). Reduced reference video quality assessment (RR-VQA) is a category of VQA where certain features (e.g., texture, edges) of the original video are provided for quality assessment. It is a popular research area for various applications such as social media, online games, and video streaming. This paper introduces a reduced reference Transcoding Quality Prediction Model (TQPM) to determine the visual quality score of the video possibly transcoded in multiple stages. The quality is predicted using Discrete Cosine Transform (DCT)-energy-based features of the video (i.e., the video's brightness, spatial texture information, and temporal activity) and the target bitrate representation of each transcoding stage. To do that, the problem is formulated, and a Long Short-Term Memory (LSTM)-based quality prediction model is presented. Experimental results illustrate that, on average, TQPM yields PSNR, SSIM, and VMAF predictions with an R2 score of 0.83, 0.85, and 0.87, respectively, and Mean Absolute Error (MAE) of 1.31 dB, 1.19 dB, and 3.01, respectively, for single-stage transcoding. Furthermore, an R2 score of 0.84, 0.86, and 0.91, respectively, and MAE of 1.32 dB, 1.33 dB, and 3.25, respectively, are observed for a two-stage transcoding scenario. Moreover, the average processing time of TQPM for 4s segments is 0.328s, making it a practical VQA method in online streaming applications., Comment: 2023 Mile High Video (MHV)

This paper provides an overview of the current state-of-the-art in selective harvesting robots (SHRs) and their potential for addressing the challenges of global food production. SHRs have the potential to increase productivity, reduce labour costs, and minimise food waste by selectively harvesting only ripe fruits and vegetables. The paper discusses the main components of SHRs, including perception, grasping, cutting, motion planning, and control. It also highlights the challenges in developing SHR technologies, particularly in the areas of robot design, motion planning and control. The paper also discusses the potential benefits of integrating AI and soft robots and data-driven methods to enhance the performance and robustness of SHR systems. Finally, the paper identifies several open research questions in the field and highlights the need for further research and development efforts to advance SHR technologies to meet the challenges of global food production. Overall, this paper provides a starting point for researchers and practitioners interested in developing SHRs and highlights the need for more research in this field., Comment: Preprint: to be appeared in Journal of Field Robotics

Development of new polymeric binders can help enable the use of silicon-rich anodes in Li-ion batteries, by providing stronger adhesion to the active material particles. The compositional features that improve interfacial interactions and mechanical properties can often impart electronic conductivity and redox activity to these polymers, which are generally seen as beneficial to cell performance. Alternatively, it is also possible that the addition of charge-transferring centers to the electrode can accelerate cell degradation. Here, we use an aromatic polyimide (~320 mAh/g of reversible capacity) to explore how a redox-active conductive polymer can affect cell performance. We demonstrate that the lithiated polymer is less stable than the traditional binders upon storage, leading to increased rates of calendar aging. Furthermore, we show that the adhesion properties of the polymer deteriorate upon repeated cycling, to an extent that is proportional to the degree of delithiation of the binder. More critically, we show that progressive degradation of the redox behavior of the polymer leads to the release of extra Li+ into the cell, which can give the false perception of good performance even under conditions of poor stability. Our work suggests that redox-active conductive binders can sometimes be detrimental to cell performance, and that works evaluating new polymers must include careful experimental validation under realistic conditions.

Recent research has shown that hardware fuzzers can effectively detect security vulnerabilities in modern processors. However, existing hardware fuzzers do not fuzz well the hard-to-reach design spaces. Consequently, these fuzzers cannot effectively fuzz security-critical control- and data-flow logic in the processors, hence missing security vulnerabilities. To tackle this challenge, we present HyPFuzz, a hybrid fuzzer that leverages formal verification tools to help fuzz the hard-to-reach part of the processors. To increase the effectiveness of HyPFuzz, we perform optimizations in time and space. First, we develop a scheduling strategy to prevent under- or over-utilization of the capabilities of formal tools and fuzzers. Second, we develop heuristic strategies to select points in the design space for the formal tool to target. We evaluate HyPFuzz on five widely-used open-source processors. HyPFuzz detected all the vulnerabilities detected by the most recent processor fuzzer and found three new vulnerabilities that were missed by previous extensive fuzzing and formal verification. This led to two new common vulnerabilities and exposures (CVE) entries. HyPFuzz also achieves 11.68$\times$ faster coverage than the most recent processor fuzzer., Comment: To be published in the proceedings of the 32st USENIX Security Symposium, 2023

Given a graph and an integer $k$, Densest $k$-Subgraph is the algorithmic task of finding the subgraph on $k$ vertices with the maximum number of edges. This is a fundamental problem that has been subject to intense study for decades, with applications spanning a wide variety of fields. The state-of-the-art algorithm is an $O(n^{1/4 + \epsilon})$-factor approximation (for any $\epsilon > 0$) due to Bhaskara et al. [STOC '10]. Moreover, the so-called log-density framework predicts that this is optimal, i.e. it is impossible for an efficient algorithm to achieve an $O(n^{1/4 - \epsilon})$-factor approximation. In the average case, Densest $k$-Subgraph is a prototypical noisy inference task which is conjectured to exhibit a statistical-computational gap. In this work, we provide the strongest evidence yet of hardness for Densest $k$-Subgraph by showing matching lower bounds against the powerful Sum-of-Squares (SoS) algorithm, a meta-algorithm based on convex programming that achieves state-of-art algorithmic guarantees for many optimization and inference problems. For $k \leq n^{\frac{1}{2}}$, we obtain a degree $n^{\delta}$ SoS lower bound for the hard regime as predicted by the log-density framework. To show this, we utilize the modern framework for proving SoS lower bounds on average-case problems pioneered by Barak et al. [FOCS '16]. A key issue is that small denser-than-average subgraphs in the input will greatly affect the value of the candidate pseudoexpectation operator around the subgraph. To handle this challenge, we devise a novel matrix factorization scheme based on the positive minimum vertex separator. We then prove an intersection tradeoff lemma to show that the error terms when using this separator are indeed small.

This paper presents a novel soft tactile skin (STS) technology operating with sound waves. In this innovative approach, the sound waves generated by a speaker travel in channels embedded in a soft membrane and get modulated due to a deformation of the channel when pressed by an external force and received by a microphone at the end of the channel. The sensor leverages regression and classification methods for estimating the normal force and its contact location. Our sensor can be affixed to any robot part, e.g., end effectors or arm. We tested several regression and classifier methods to learn the relation between sound wave modulation, the applied force, and its location, respectively and picked the best-performing models for force and location predictions. Our novel tactile sensor yields 93% of the force estimation within 1.5 N tolerances for a range of 0-30+1 N and estimates contact locations with over 96% accuracy. We also demonstrated the performance of STS technology for a real-time gripping force control application., Comment: IEEE International Conference on Robotics and Automation (ICRA) 2024 (accepted)

It is generally believed that silicon-based anodes for Li-ion batteries would benefit from stronger binders, as cyclic volume changes would not disrupt the cohesion of the composite electrode. Here, we put this belief to the proof by testing electrodes containing SiOx particles and an aromatic polyimide binder. We observe that the electrodes can stretch laterally by as much as 6% during the first cycle, indicating that internal stresses are high enough to induce plastic deformation on the copper current collector. Remarkably, no coating delamination is observed. Additional consequences were size-dependent: while pouch-cell-sized electrodes developed wrinkles, coin-cell-sized ones remained mostly smooth. We demonstrate that wrinkling of the current collector damages the electrode coating, inactivating SiOx domains and accelerating capacity fade. This size-dependent performance decay indicates that, in extreme cases, testing outcomes are highly dependent on scale. Novel battery materials may require testing at larger cell formats for complete validation.

This work discusses a few theories including the interaction of dark matter, cosmic strings, and locally coupled dark energy. The paper also examines mathematical models used to describe the pressure and density within a star, including the polytropic relationship and the Lane-Emden equation. Simulation results from the IllustrisTNG datasets are also presented, providing insights into the interacting dark matter solutions. With the derived solutions this paper, it explores the possible causes for the sudden disappearance of the star PHL293B-LBV, Comment: 23 pages, 2 figures

Efficient exploration is critical in cooperative deep Multi-Agent Reinforcement Learning (MARL). In this work, we propose an exploration method that effectively encourages cooperative exploration based on the idea of sequential action-computation scheme. The high-level intuition is that to perform optimism-based exploration, agents would explore cooperative strategies if each agent's optimism estimate captures a structured dependency relationship with other agents. Assuming agents compute actions following a sequential order at \textit{each environment timestep}, we provide a perspective to view MARL as tree search iterations by considering agents as nodes at different depths of the search tree. Inspired by the theoretically justified tree search algorithm UCT (Upper Confidence bounds applied to Trees), we develop a method called Conditionally Optimistic Exploration (COE). COE augments each agent's state-action value estimate with an action-conditioned optimistic bonus derived from the visitation count of the global state and joint actions of preceding agents. COE is performed during training and disabled at deployment, making it compatible with any value decomposition method for centralized training with decentralized execution. Experiments across various cooperative MARL benchmarks show that COE outperforms current state-of-the-art exploration methods on hard-exploration tasks., Comment: Accepted at UAI 2023

One of the key behavioral characteristics used in neuroscience to determine whether the subject of study -- be it a rodent or a human -- exhibits model-based learning is effective adaptation to local changes in the environment, a particular form of adaptivity that is the focus of this work. In reinforcement learning, however, recent work has shown that modern deep model-based reinforcement-learning (MBRL) methods adapt poorly to local environment changes. An explanation for this mismatch is that MBRL methods are typically designed with sample-efficiency on a single task in mind and the requirements for effective adaptation are substantially higher, both in terms of the learned world model and the planning routine. One particularly challenging requirement is that the learned world model has to be sufficiently accurate throughout relevant parts of the state-space. This is challenging for deep-learning-based world models due to catastrophic forgetting. And while a replay buffer can mitigate the effects of catastrophic forgetting, the traditional first-in-first-out replay buffer precludes effective adaptation due to maintaining stale data. In this work, we show that a conceptually simple variation of this traditional replay buffer is able to overcome this limitation. By removing only samples from the buffer from the local neighbourhood of the newly observed samples, deep world models can be built that maintain their accuracy across the state-space, while also being able to effectively adapt to local changes in the reward function. We demonstrate this by applying our replay-buffer variation to a deep version of the classical Dyna method, as well as to recent methods such as PlaNet and DreamerV2, demonstrating that deep model-based methods can adapt effectively as well to local changes in the environment.

This paper introduces a novel approach to address the problem of Physical Robot Interaction (PRI) during robot pushing tasks. The approach uses a data-driven forward model based on tactile predictions to inform the controller about potential future movements of the object being pushed, such as a strawberry stem, using a robot tactile finger. The model is integrated into a Deep Functional Predictive Control (d-FPC) system to control the displacement of the stem on the tactile finger during pushes. Pushing an object with a robot finger along a desired trajectory in 3D is a highly nonlinear and complex physical robot interaction, especially when the object is not stably grasped. The proposed approach controls the stem movements on the tactile finger in a prediction horizon. The effectiveness of the proposed FPC is demonstrated in a series of tests involving a real robot pushing a strawberry in a cluster. The results indicate that the d-FPC controller can successfully control PRI in robotic manipulation tasks beyond the handling of strawberries. The proposed approach offers a promising direction for addressing the challenging PRI problem in robotic manipulation tasks. Future work will explore the generalisation of the approach to other objects and tasks., Comment: Submitted to IEEE IROS 2023

In practical scenarios, it is often the case that the available training data within the target domain only exist for a limited number of classes, with the remaining classes only available within surrogate domains. We show that including the target domain in training when there exist disjoint classes between the target and surrogate domains creates significant negative transfer, and causes performance to significantly decrease compared to training without the target domain at all. We hypothesize that this negative transfer is due to an intermediate shortcut that only occurs when multiple source domains are present, and provide experimental evidence that this may be the case. We show that this phenomena occurs on over 25 distinct domain shifts, both synthetic and real, and in many cases deteriorates the performance to well worse than random, even when using state-of-the-art domain adaptation methods., Comment: 8 pages

The rise in video streaming applications has increased the demand for video quality assessment (VQA). In 2016, Netflix introduced Video Multi-Method Assessment Fusion (VMAF), a full reference VQA metric that strongly correlates with perceptual quality, but its computation is time-intensive. We propose a Discrete Cosine Transform (DCT)-energy-based VQA with texture information fusion (VQ-TIF) model for video streaming applications that determines the visual quality of the reconstructed video compared to the original video. VQ-TIF extracts Structural Similarity (SSIM) and spatiotemporal features of the frames from the original and reconstructed videos and fuses them using a long short-term memory (LSTM)-based model to estimate the visual quality. Experimental results show that VQ-TIF estimates the visual quality with a Pearson Correlation Coefficient (PCC) of 0.96 and a Mean Absolute Error (MAE) of 2.71, on average, compared to the ground truth VMAF scores. Additionally, VQ-TIF estimates the visual quality at a rate of 9.14 times faster than the state-of-the-art VMAF implementation, along with an 89.44 % reduction in energy consumption, assuming an Ultra HD (2160p) display resolution., Comment: 2024 Mile High Video (MHV)

We develop new tools in the theory of nonlinear random matrices and apply them to study the performance of the Sum of Squares (SoS) hierarchy on average-case problems. The SoS hierarchy is a powerful optimization technique that has achieved tremendous success for various problems in combinatorial optimization, robust statistics and machine learning. It's a family of convex relaxations that lets us smoothly trade off running time for approximation guarantees. In recent works, it's been shown to be extremely useful for recovering structure in high dimensional noisy data. It also remains our best approach towards refuting the notorious Unique Games Conjecture. In this work, we analyze the performance of the SoS hierarchy on fundamental problems stemming from statistics, theoretical computer science and statistical physics. In particular, we show subexponential-time SoS lower bounds for the problems of the Sherrington-Kirkpatrick Hamiltonian, Planted Slightly Denser Subgraph, Tensor Principal Components Analysis and Sparse Principal Components Analysis. These SoS lower bounds involve analyzing large random matrices, wherein lie our main contributions. These results offer strong evidence for the truth of and insight into the low-degree likelihood ratio hypothesis, an important conjecture that predicts the power of bounded-time algorithms for hypothesis testing. We also develop general-purpose tools for analyzing the behavior of random matrices which are functions of independent random variables. Towards this, we build on and generalize the matrix variant of the Efron-Stein inequalities. In particular, our general theorem on matrix concentration recovers various results that have appeared in the literature. We expect these random matrix theory ideas to have other significant applications., Comment: Dissertation, University of Chicago

Decentralized cooperative multi-agent deep reinforcement learning (MARL) can be a versatile learning framework, particularly in scenarios where centralized training is either not possible or not practical. One of the critical challenges in decentralized deep MARL is the non-stationarity of the learning environment when multiple agents are learning concurrently. A commonly used and efficient scheme for decentralized MARL is independent learning in which agents concurrently update their policies independently of each other. We first show that independent learning does not always converge, while sequential learning where agents update their policies one after another in a sequence is guaranteed to converge to an agent-by-agent optimal solution. In sequential learning, when one agent updates its policy, all other agent's policies are kept fixed, alleviating the challenge of non-stationarity due to simultaneous updates in other agents' policies. However, it can be slow because only one agent is learning at any time. Therefore it might also not always be practical. In this work, we propose a decentralized cooperative MARL algorithm based on multi-timescale learning. In multi-timescale learning, all agents learn simultaneously, but at different learning rates. In our proposed method, when one agent updates its policy, other agents are allowed to update their policies as well, but at a slower rate. This speeds up sequential learning, while also minimizing non-stationarity caused by other agents updating concurrently. Multi-timescale learning outperforms state-of-the-art decentralized learning methods on a set of challenging multi-agent cooperative tasks in the epymarl(Papoudakis et al., 2020) benchmark. This can be seen as a first step towards more general decentralized cooperative deep MARL methods based on multi-timescale learning.

Near-field imaging has emerged as a reliable probe of the dielectric function of van der Waals crystals. In principle, analyzing the propagation patterns of subwavelength waveguide modes (WMs) allows for extraction of the full dielectric tensor. Yet previous studies have mostly been restricted to high-symmetry materials or narrowband probing. Here, we resolve in-plane anisotropic WMs in thin rhenium disulfide (ReS2) crystals across a wide range of near-infrared frequencies. By tracing the evolution of these modes as a function of crystallographic direction, polarization of the electric field and sample thickness, we have determined the anisotropic dielectric tensor including the elusive out-of-plane response. The excitonic absorption at ~1.5 eV manifests itself as a clear backbending feature in the WM dispersion and a reduction of the quality factors as fully supported by numerical calculations. Our results extend the sensitivity of near-field microscopy towards biaxial anisotropy and provide key insights into the optoelectronic properties of ReS2., Comment: This document is the Accepted Manuscript version of a Published Work that appeared in final form in ACS Photonics (copyright \copyright American Chemical Society) after peer review and technical editing by the publisher. To access the final edited and published work see https://pubs.acs.org/doi/10.1021/acsphotonics.1c01841

Accurate, timely and selective detection of moving obstacles is crucial for reliable collision avoidance in autonomous robots. The area- and energy-inefficiency of CMOS-based spiking neurons for obstacle detection can be addressed through the reconfigurable, tunable and low-power operation capabilities of emerging two-dimensional (2D) materials-based devices. We present an ultra-low power spiking neuron built using an electrostatically tuned dual-gate transistor with an ultra-thin and generic 2D material channel. The 2D subthreshold transistor (2D-ST) is carefully designed to operate under low-current subthreshold regime. Carrier transport has been modelled via over-the-barrier thermionic and Fowler-Nordheim contact barrier tunnelling currents over a wide range of gate and drain biases. Simulation of a neuron circuit designed using the 2D-ST with 45 nm CMOS technology components shows high energy efficiency of ~3.5 pJ/spike and biomimetic class-I as well as oscillatory spiking. It also demonstrates complex neuronal behaviors such as spike-frequency adaptation and post-inhibitory rebound that are crucial for dynamic visual systems. Lobula giant movement detector (LGMD) is a collision-detecting biological neuron found in locusts. Our neuron circuit can generate LGMD-like spiking behavior and detect obstacles at an energy cost of <100 pJ. Further, it can be reconfigured to distinguish between looming and receding objects with high selectivity., Comment: Main text along with supporting information. 4 figures

Bayesian Neural Networks (BNNs) can overcome the problem of overconfidence that plagues traditional frequentist deep neural networks, and are hence considered to be a key enabler for reliable AI systems. However, conventional hardware realizations of BNNs are resource intensive, requiring the implementation of random number generators for synaptic sampling. Owing to their inherent stochasticity during programming and read operations, nanoscale memristive devices can be directly leveraged for sampling, without the need for additional hardware resources. In this paper, we introduce a novel Phase Change Memory (PCM)-based hardware implementation for BNNs with binary synapses. The proposed architecture consists of separate weight and noise planes, in which PCM cells are configured and operated to represent the nominal values of weights and to generate the required noise for sampling, respectively. Using experimentally observed PCM noise characteristics, for the exemplary Breast Cancer Dataset classification problem, we obtain hardware accuracy and expected calibration error matching that of an 8-bit fixed-point (FxP8) implementation, with projected savings of over 9$\times$ in terms of core area transistor count., Comment: Submitted and Accepted in ISCAS 2023

Minerals are solid state nuclear track detectors - nuclear recoils in a mineral leave latent damage to the crystal structure. Depending on the mineral and its temperature, the damage features are retained in the material from minutes (in low-melting point materials such as salts at a few hundred degrees C) to timescales much larger than the 4.5 Gyr-age of the Solar System (in refractory materials at room temperature). The damage features from the $O(50)$ MeV fission fragments left by spontaneous fission of $^{238}$U and other heavy unstable isotopes have long been used for fission track dating of geological samples. Laboratory studies have demonstrated the readout of defects caused by nuclear recoils with energies as small as $O(1)$ keV. This whitepaper discusses a wide range of possible applications of minerals as detectors for $E_R \gtrsim O(1)$ keV nuclear recoils: Using natural minerals, one could use the damage features accumulated over $O(10)$ Myr$-O(1)$ Gyr to measure astrophysical neutrino fluxes (from the Sun, supernovae, or cosmic rays interacting with the atmosphere) as well as search for Dark Matter. Using signals accumulated over months to few-years timescales in laboratory-manufactured minerals, one could measure reactor neutrinos or use them as Dark Matter detectors, potentially with directional sensitivity. Research groups in Europe, Asia, and America have started developing microscopy techniques to read out the $O(1) - O(100)$ nm damage features in crystals left by $O(0.1) - O(100)$ keV nuclear recoils. We report on the status and plans of these programs. The research program towards the realization of such detectors is highly interdisciplinary, combining geoscience, material science, applied and fundamental physics with techniques from quantum information and Artificial Intelligence., Comment: 115 pages, many pictures of tracks. Please see the source file for higher resolution versions of some plots. v2: matches the published version

To predict liquid-gas two-phase flow phenomena, accurate tracking and prediction of the evolving liquid-gas interface is required. Volume-of-Fluid or VoF method has been used in the literature for computationally modeling of such flows. In the VoF method, a single set of governing equations are solved for both phases along with an advection equation for the volume fraction. The properties in each computational cell are determined by a linear weighted average of the properties of the two fluids based on the phase fraction. While the method predicts water-air flows well, the predictions tend to deviate significantly from experimental data for liquids with high viscosity. A new property averaging technique is proposed in this paper, which is shown to provide accurate results for high viscosity liquids. Computational predictions using the open source VoF solver interFoam (available as a part of the OpenFOAM computational tool), and those obtained using the proposed method are compared with experimental data for multiple two-phase applications. Four different problems, viz., suspended droplet in air, jet breakup, drop impact on thin films, and air entrapment during drop interaction with liquid pool, are considered to extensively validate the new method. Experimental data are used to cover a range of surface tension and viscosities. For all cases, the modified VoF solver is observed to perform significantly better than original VoF method., Comment: Journal of Fluids Engineering