Search

The rapid advancement of large language models (LLMs) and multimodal learning has transformed digital content creation and manipulation. Traditional visual editing tools require significant expertise, limiting accessibility. Recent strides in instruction-based editing have enabled intuitive interaction with visual content, using natural language as a bridge between user intent and complex editing operations. This survey provides an overview of these techniques, focusing on how LLMs and multimodal models empower users to achieve precise visual modifications without deep technical knowledge. By synthesizing over 100 publications, we explore methods from generative adversarial networks to diffusion models, examining multimodal integration for fine-grained content control. We discuss practical applications across domains such as fashion, 3D scene manipulation, and video synthesis, highlighting increased accessibility and alignment with human intuition. Our survey compares existing literature, emphasizing LLM-empowered editing, and identifies key challenges to stimulate further research. We aim to democratize powerful visual editing across various industries, from entertainment to education. Interested readers are encouraged to access our repository at https://github.com/tamlhp/awesome-instruction-editing., Comment: Fixed a serious error in author information

Internet of Things and Deep Learning are synergetically and exponentially growing industrial fields with a massive call for their unification into a common framework called Edge AI. While on-device inference is a well-explored topic in recent research, backpropagation remains an open challenge due to its prohibitive computational and memory costs compared to the extreme resource constraints of embedded devices. Drawing on tensor decomposition research, we tackle the main bottleneck of backpropagation, namely the memory footprint of activation map storage. We investigate and compare the effects of activation compression using Singular Value Decomposition and its tensor variant, High-Order Singular Value Decomposition. The application of low-order decomposition results in considerable memory savings while preserving the features essential for learning, and also offers theoretical guarantees to convergence. Experimental results obtained on main-stream architectures and tasks demonstrate Pareto-superiority over other state-of-the-art solutions, in terms of the trade-off between generalization and memory footprint.

This paper considers a class of thrust vectoring systems, which are nonlinear, overactuated, and time-invariant. We assume that the system is composed of two subsystems and there exist singular points around which the linearized system is uncontrollable. Furthermore, we assume that the system is stabilizable through a two-level control allocation. In this particular setting, we cannot do much with the linearized system, and a direct nonlinear control approach must be used to analyze the system stability. Under adequate assumptions and a suitable nonlinear continuous control-allocation law, we can prove uniform asymptotic convergence of the points of equilibrium using Lyapunov input-to-state stability and the small gain theorem. This control allocation, however, requires the design of an allocated mapping and introduces two exogenous inputs. In particular, the closed-loop system is cascaded, and the output of one subsystem is the disturbance of the other, and vice versa. In general, it is difficult to find a closed-form solution for the allocated mapping; it needs to satisfy restrictive conditions, among which Lipschitz continuity to ensure that the disturbances eventually vanish. Additionally, this mapping is in general nontrivial and non-unique. In this paper, we propose a new kernel-based predictive control allocation to substitute the need for designing an analytic mapping, and assess if it can produce a meaningful mapping ``on-the-fly" by solving online an optimization problem. The simulations include three examples, which are the manipulation of an object through an unmanned aerial vehicle in two and three dimensions, and the control of a surface vessel actuated by two azimuthal thrusters., Comment: The preliminary results were presented in `Nguyen, Tam W., Kenji Hirata, and Kyoungseok Han. "A Nullspace-Based Predictive Control Allocation for the Control of a Quadcopter Manipulating an Object Attached to the Ground." IFAC-PapersOnLine 56.2 (2023): 6286-6291.'

The Water Cherenkov Detector Array (WCDA) is one of the components of Large High Altitude Air Shower Observatory (LHAASO) and can monitor any sources over two-thirds of the sky for up to 7 hours per day with >98\% duty cycle. In this work, we report the detection of two outbursts of the Fanaroff-Riley I radio galaxy NGC 1275 that were detected by LHAASO-WCDA between November 2022 and January 2023 with statistical significance of 5.2~$\sigma$ and 8.3~$\sigma$. The observed spectral energy distribution in the range from 500 GeV to 3 TeV is fitted by a power-law with a best-fit spectral index of $\alpha=-3.37\pm0.52$ and $-3.35\pm0.29$, respectively. The outburst flux above 0.5~TeV was ($4.55\pm 4.21)\times~10^{-11}~\rm cm^{-2}~s^{-1}$ and ($3.45\pm 1.78)\times~10^{-11}~\rm cm^{-2}~s^{-1}$, corresponding to 60\%, 45\% of Crab Nebula flux. Variation analysis reveals the variability time-scale of days at the TeV energy band. A simple test by one-zone synchrotron self-Compton model reproduces the data in the gamma-ray band well., Comment: 11 pages, 8 figures, 3 tables

In logistics, the ability to quickly compute and execute pick-and-place motions from bins is critical to increasing productivity. We present Bin-Optimized Motion Planning (BOMP), a motion planning framework that plans arm motions for a six-axis industrial robot with a long-nosed suction tool to remove boxes from deep bins. BOMP considers robot arm kinematics, actuation limits, the dimensions of a grasped box, and a varying height map of a bin environment to rapidly generate time-optimized, jerk-limited, and collision-free trajectories. The optimization is warm-started using a deep neural network trained offline in simulation with 25,000 scenes and corresponding trajectories. Experiments with 96 simulated and 15 physical environments suggest that BOMP generates collision-free trajectories that are up to 58 % faster than baseline sampling-based planners and up to 36 % faster than an industry-standard Up-Over-Down algorithm, which has an extremely low 15 % success rate in this context. BOMP also generates jerk-limited trajectories while baselines do not. Website: https://sites.google.com/berkeley.edu/bomp.

GPT-4o is an autoregressive omni model that accepts as input any combination of text, audio, image, and video, and generates any combination of text, audio, and image outputs. It's trained end-to-end across text, vision, and audio, meaning all inputs and outputs are processed by the same neural network. GPT-4o can respond to audio inputs in as little as 232 milliseconds, with an average of 320 milliseconds, which is similar to human response time in conversation. It matches GPT-4 Turbo performance on text in English and code, with significant improvement on text in non-English languages, while also being much faster and 50\% cheaper in the API. GPT-4o is especially better at vision and audio understanding compared to existing models. In line with our commitment to building AI safely and consistent with our voluntary commitments to the White House, we are sharing the GPT-4o System Card, which includes our Preparedness Framework evaluations. In this System Card, we provide a detailed look at GPT-4o's capabilities, limitations, and safety evaluations across multiple categories, focusing on speech-to-speech while also evaluating text and image capabilities, and measures we've implemented to ensure the model is safe and aligned. We also include third-party assessments on dangerous capabilities, as well as discussion of potential societal impacts of GPT-4o's text and vision capabilities.

Imaging atmospheric Cherenkov telescopes (IACTs) are used to observe very high-energy photons from the ground. Gamma rays are indirectly detected through the Cherenkov light emitted by the air showers they induce. The new generation of experiments, in particular the Cherenkov Telescope Array Observatory (CTAO), sets ambitious goals for discoveries of new gamma-ray sources and precise measurements of the already discovered ones. To achieve these goals, both hardware and data analysis must employ cutting-edge techniques. This also applies to the LST-1, the first IACT built for the CTAO, which is currently taking data on the Canary island of La Palma. This paper introduces a new event reconstruction technique for IACT data, aiming to improve the image reconstruction quality and the discrimination between the signal and the background from misidentified hadrons and electrons. The technique models the development of the extensive air shower signal, recorded as a waveform per pixel, seen by CTAO telescopes' cameras. Model parameters are subsequently passed to random forest regressors and classifiers to extract information on the primary particle. The new reconstruction was applied to simulated data and to data from observations of the Crab Nebula performed by the LST-1. The event reconstruction method presented here shows promising performance improvements. The angular and energy resolution, and the sensitivity, are improved by 10 to 20% over most of the energy range. At low energy, improvements reach up to 22%, 47%, and 50%, respectively. A future extension of the method to stereoscopic analysis for telescope arrays will be the next important step., Comment: Accepted in A&A

In this paper, we propose a distributed first-order algorithm with backtracking linesearch for solving multi-agent minimisation problems, where each agent handles a local objective involving nonsmooth and smooth components. Unlike existing methods that require global Lipschitz continuity and predefined stepsizes, our algorithm adjusts stepsizes using distributed linesearch procedures, making it suitable for problems where global constants are unavailable or difficult to compute. The proposed algorithm is designed within an abstract linesearch framework for a primal-dual proximal-gradient method to solve min-max convex-concave problems, enabling the consensus constraint to be decoupled from the optimisation task. Our theoretical analysis allows for gradients of functions to be locally Lipschitz continuous, relaxing the prevalent assumption of globally Lipschitz continuous gradients., Comment: 21 pages

The aggressiveness of prostate cancer, the most common cancer in men worldwide, is primarily assessed based on histopathological data using the Gleason scoring system. While artificial intelligence (AI) has shown promise in accurately predicting Gleason scores, these predictions often lack inherent explainability, potentially leading to distrust in human-machine interactions. To address this issue, we introduce a novel dataset of 1,015 tissue microarray core images, annotated by an international group of 54 pathologists. The annotations provide detailed localized pattern descriptions for Gleason grading in line with international guidelines. Utilizing this dataset, we develop an inherently explainable AI system based on a U-Net architecture that provides predictions leveraging pathologists' terminology. This approach circumvents post-hoc explainability methods while maintaining or exceeding the performance of methods trained directly for Gleason pattern segmentation (Dice score: 0.713 $\pm$ 0.003 trained on explanations vs. 0.691 $\pm$ 0.010 trained on Gleason patterns). By employing soft labels during training, we capture the intrinsic uncertainty in the data, yielding strong results in Gleason pattern segmentation even in the context of high interobserver variability. With the release of this dataset, we aim to encourage further research into segmentation in medical tasks with high levels of subjectivity and to advance the understanding of pathologists' reasoning processes., Comment: 58 pages, 15 figures (incl. supplementary)

Currently, it is challenging to investigate aneurismal hemodynamics based on current in-vivo data such as Magnetic Resonance Imaging or Computed Tomography due to the limitations in both spatial and temporal resolutions. In this work, we investigate the use of modal analysis at various resolutions to examine its usefulness for analyzing blood flows in brain aneurysms. Two variants of Dynamic Mode Decomposition (DMD): (i) Hankel-DMD; and (ii) Optimized-DMD, are used to extract the time-dependent dynamics of blood flows during one cardiac cycle. First, high-resolution hemodynamic data in patient-specific aneurysms are obtained using Computational Fluid Dynamics. Second, the dynamics modes, along with their spatial amplitudes and temporal magnitudes are calculated using the DMD analysis. Third, an examination of DMD analyses using a range of spatial and temporal resolutions of hemodynamic data to validate the applicability of DMD for low-resolution data, similar to ones in clinical practices. Our results show that DMD is able to characterize the inflow jet dynamics by separating large-scale structures and flow instabilities even at low spatial and temporal resolutions. Its robustness in quantifying the flow dynamics using the energy spectrum is demonstrated across different resolutions in all aneurysms in our study population. Our work indicates that DMD can be used for analyzing blood flow patterns of brain aneurysms and is a promising tool to be explored in in-vivo.

Federated Learning (FL) enables multiple devices to collaboratively train a shared model while preserving data privacy. Ever-increasing model complexity coupled with limited memory resources on the participating devices severely bottlenecks the deployment of FL in real-world scenarios. Thus, a framework that can effectively break the memory wall while jointly taking into account the hardware and statistical heterogeneity in FL is urgently required. In this paper, we propose SmartSplit, a framework that effectively reduces the memory footprint on the device side while guaranteeing the training progress and model accuracy for heterogeneous FL through model splitting.Towards this end, SmartSplit employs a hierarchical structure to adaptively guide the overall training process. In each training round, the central manager, hosted on the server, dynamically selects the participating devices and sets the cutting layer by jointly considering the memory budget, training capacity, and data distribution of each device. The MEC manager, deployed within the edge server, proceeds to split the local model and perform training of the server-side portion. Meanwhile, it fine-tunes the splitting points based on the time-evolving statistical importance. The on-device manager, embedded inside each mobile device, continuously monitors the local training status while employing cost-aware checkpointing to match the runtime dynamic memory budget. Extensive experiments on representative datasets are conducted on both commercial off-the-shelf mobile device testbeds. The experimental results show that SmartSplit excels in FL training on highly memory-constrained mobile SoCs, offering up to a 94% peak latency reduction and 100-fold memory savings. It enhances accuracy performance by 1.49%-57.18% and adaptively adjusts to dynamic memory budgets through cost-aware recomputation., Comment: Accepted by TPDS

In Federated Learning (FL), anomaly detection (AD) is a challenging task due to the decentralized nature of data and the presence of non-IID data distributions. This study introduces a novel federated threshold calculation method that leverages summary statistics from both normal and anomalous data to improve the accuracy and robustness of anomaly detection using autoencoders (AE) in a federated setting. Our approach aggregates local summary statistics across clients to compute a global threshold that optimally separates anomalies from normal data while ensuring privacy preservation. We conducted extensive experiments using publicly available datasets, including Credit Card Fraud Detection, Shuttle, and Covertype, under various data distribution scenarios. The results demonstrate that our method consistently outperforms existing federated and local threshold calculation techniques, particularly in handling non-IID data distributions. This study also explores the impact of different data distribution scenarios and the number of clients on the performance of federated anomaly detection. Our findings highlight the potential of using summary statistics for threshold calculation in improving the scalability and accuracy of federated anomaly detection systems.

Hyperparameter optimization is an essential component in many data science pipelines and typically entails exhaustive time and resource-consuming computations in order to explore the combinatorial search space. Similar to this problem, other key operations in data science pipelines exhibit the exact same properties. Important examples are: neural architecture search, where the goal is to identify the best design choices for a neural network, and query cardinality estimation, where given different predicate values for a SQL query the goal is to estimate the size of the output. In this paper, we abstract away those essential components of data science pipelines and we model them as instances of tensor completion, where each variable of the search space corresponds to one mode of the tensor, and the goal is to identify all missing entries of the tensor, corresponding to all combinations of variable values, starting from a very small sample of observed entries. In order to do so, we first conduct a thorough experimental evaluation of existing state-of-the-art tensor completion techniques and introduce domain-inspired adaptations (such as smoothness across the discretized variable space) and an ensemble technique which is able to achieve state-of-the-art performance. We extensively evaluate existing and proposed methods in a number of datasets generated corresponding to (a) hyperparameter optimization for non-neural network models, (b) neural architecture search, and (c) variants of query cardinality estimation, demonstrating the effectiveness of tensor completion as a tool for automating data science pipelines. Furthermore, we release our generated datasets and code in order to provide benchmarks for future work on this topic.

We report the detection of an extended very-high-energy (VHE) gamma-ray source coincident with the locations of middle-aged (62.4~\rm kyr) pulsar PSR J0248+6021, by using the LHAASO-WCDA data of live 796 days and LHAASO-KM2A data of live 1216 days. A significant excess of \gray induced showers is observed both by WCDA in energy bands of 1-25~\rm TeV and KM2A in energy bands of $>$ 25~\rm TeV with 7.3 $\sigma$ and 13.5 $\sigma$, respectively. The best-fit position derived through WCDA data is R.A. = 42.06$^\circ \pm$ 0.12$^\circ$ and Dec. = 60.24$^\circ \pm $ 0.13$^\circ$ with an extension of 0.69$^\circ\pm$0.15$^\circ$ and that of the KM2A data is R.A.= 42.29$^\circ \pm $ 0.13$^\circ$ and Dec. = 60.38$^\circ \pm$ 0.07$^\circ$ with an extension of 0.37$^\circ\pm$0.07$^\circ$. No clear extended multiwavelength counterpart of this LHAASO source has been found from the radio band to the GeV band. The most plausible explanation of the VHE \gray emission is the inverse Compton process of highly relativistic electrons and positrons injected by the pulsar. These electrons/positrons are hypothesized to be either confined within the pulsar wind nebula or to have already escaped into the interstellar medium, forming a pulsar halo., Comment: 12 pages, 10 figures, Accepted by Sci. China-Phys. Mech. Astron

Open Radio Access Networks (RAN) aim to bring a paradigm shift to telecommunications industry, by enabling an open, intelligent, virtualized, and multi-vendor interoperable RAN ecosystem. At the center of this movement, O-RAN ALLIANCE defines the O-RAN architecture and standards, so that companies around the globe can use these specifications to create innovative and interoperable solutions. To accelerate the adoption of O-RAN products, rigorous testing of O-RAN Radio Unit (O-RU) and other O-RAN products plays a key role. O-RAN ALLIANCE has approved around 20 Open Testing and Integration Centres (OTICs) globally. OTICs serve as vendor-neutral platforms for providing the testing and integration services, with the vision that an O-RAN product certified in any OTIC is accepted in other parts of the world. To demonstrate the viability of such a certified-once-and-use-everywhere approach, one theme in the O-RAN Global PlugFest Spring 2024 is to demonstrate consistent and repeatable testing for the open fronthaul interface across multiple labs. Towards this, Japan OTIC and Asia Pacific OTIC in Singapore have teamed up together with an O-RU vendor and Keysight Technology. Our international team successfully completed all test cases defined by O-RAN ALLIANCE for O-RU conformance testing. In this paper, we share our journey in achieving this outcome, focusing on the challenges we have overcome and the lessons we have learned through this process., Comment: Published version at RitiRAN Workshop - co-located with IEEE VTC Fall 2024

We consider a general reaction--nonlinear-diffusion equation with a region of negative diffusivity, and show how a nonlinear regularisation selects a shock position. Negative diffusivity can model population aggregation, but leads to shock-fronted solutions for population density. In general the shock position is non-unique. Previous studies have defined shock selection criteria such as the equal area rule, and shown how these arise from specific regularisations to the reaction--diffusion equation. In this work, we show that a nonlinear regularisation leads to travelling wave solutions where the shock is selected according to a modified equal area rule. Adjusting the nonlinearity in the regularisation moves the shock location. We focus on attaining shocks that conserve diffusivity across the shock, and demonstrate that this condition yields the longest possible shock length. Using geometric singular perturbation theory, we prove the existence of shock-fronted travelling wave solutions with continuous diffusivity, show how to construct them, and demonstrate that they correspond to a unique wave speed. Numerical solutions align with theoretical predictions for shock position and wave speed, confirming that a single regularisation term can vary the shock position and attain shocks with continuous diffusivity., Comment: 31 pages, 14 figures

Over the past several decades, time-series photometry of CSPNe has yielded significant results including, but not limited to, discoveries of nearly 100 binary systems, insights into pulsations and winds in young white dwarfs, and studies of stars undergoing very late thermal pulses. We have undertaken a systematic study of optical photometric variability of cataloged CSPNe, using the epochal photometric data from the Zwicky Transient Facility (ZTF). By applying appropriate variability metrics, we arrive at a list of 94 significantly variable CSPNe. Based on the timescales of the light-curve activity, we classify the variables broadly into short- and long-timescale variables. In this first paper in this series, we focus on the former, which is the majority class comprising 83 objects. We infer periods for six sources for the first time, and recover several known periodic variables. Among the aperiodic sources, most exhibit a jitter around a median flux with a stable amplitude, and a few show outbursts. We draw attention to WeSb 1, which shows a different kind of variability: prominent deep and aperiodic dips, resembling transits from a dust/debris disk. We find strong evidence for a binary nature of WeSb 1 (possibly an A- to G-type companion). The compactness of the emission lines and inferred high electron densities make WeSb 1 a candidate for either an EGB 6-type planetary nucleus, or a symbiotic system inside an evolved planetary nebula, both of which are rare objects. To demonstrate further promise with ZTF, we report three additional newly identified periodic sources that do not appear in the list of highly variable sources. Finally, we also introduce a two-dimensional metric space defined by the von Neumann statistics and Pearson Skew and demonstrate its effectiveness in identifying unique variables of astrophysical interest, like WeSb 1., Comment: 19 pages + 8 pages appendix, 5 tables, 17 figures; Submitted to PASP; Comments are welcome!

Traditionally, gamma-ray bursts (GRBs) are classified as long and short GRBs, with $T_{90} = 2$ s being the threshold duration. Generally, long-duration GRBs (LGRBs, $T_{90}>2$ s) are associated with the collapse of massive stars, and short-duration (SGRBs, $T_{90}<2$ s) are associated with the compact binary mergers involving at least one neutron star. However, the existence of a population of so-called ``peculiar GRBs", i.e., LGRBs originating from mergers, or long Type I GRBs, and SGRBs originating from collapsars, or short Type II GRBs, have challenged the traditional paradigm of GRB classification. Finding more peculiar GRBs may help to give us more insight into this issue. In this work, we analyze the properties of machine learning identified long Type I GRBs and short Type II GRBs candidates, long GRBs-I and short GRBs-II (the so-called ``peculiar GRBs"). We find that long GRBs-I almost always exhibit properties similar to Type I, which suggests that the merger may indeed produce GRBs with $T_{90}>2$ s. Furthermore, according to the probability given by the redshift distribution, short GRBs-II almost exhibit properties similar to Type II. This suggests that the populations of short Type II GRBs are not scarce and that they are hidden in a large number of samples without redshifts, which is unfavorable to the interpretation that the jet progression leads to a missed main emission., Comment: 20 pages, 7 figures, Accepted for publication in the ApJ

Merging has become a widespread way to cheaply combine individual models into a single model that inherits their capabilities and attains better performance. This popularity has spurred rapid development of many new merging methods, which are typically validated in disparate experimental settings and frequently differ in the assumptions made about model architecture, data availability, and computational budget. In this work, we characterize the relative merits of different merging methods by evaluating them in a shared experimental setting and precisely identifying the practical requirements of each method. Specifically, our setting focuses on using merging for compositional generalization of capabilities in image classification, image generation, and natural language processing. Additionally, we measure the computational costs of different merging methods as well as how they perform when scaling the number of models being merged. Taken together, our results clarify the state of the field of model merging and provide a comprehensive and rigorous experimental setup to test new methods.

The increasing use of text as data in social science research necessitates the development of valid, consistent, reproducible, and efficient methods for generating text-based concept measures. This paper presents a novel method that leverages the internal hidden states of large language models (LLMs) to generate these concept measures. Specifically, the proposed method learns a concept vector that captures how the LLM internally represents the target concept, then estimates the concept value for text data by projecting the text's LLM hidden states onto the concept vector. Three replication studies demonstrate the method's effectiveness in producing highly valid, consistent, and reproducible text-based measures across various social science research contexts, highlighting its potential as a valuable tool for the research community.

Cameras are integral components of many critical intelligent systems. However, a growing threat, known as Electromagnetic Signal Injection Attacks (ESIA), poses a significant risk to these systems, where ESIA enables attackers to remotely manipulate images captured by cameras, potentially leading to malicious actions and catastrophic consequences. Despite the severity of this threat, the underlying reasons for ESIA's effectiveness remain poorly understood, and effective countermeasures are lacking. This paper aims to address these gaps by investigating ESIA from two distinct aspects: pixel loss and color strips. By analyzing these aspects separately on image classification tasks, we gain a deeper understanding of how ESIA can compromise intelligent systems. Additionally, we explore a lightweight solution to mitigate the effects of ESIA while acknowledging its limitations. Our findings provide valuable insights for future research and development in the field of camera security and intelligent systems., Comment: 2 pages, 2 figures

We show that the isometry group of a finite-volume hyperbolic 3-manifold acts simply transitively on many of its closed geodesics. Combining this observation with the Virtual Special Theorems of the first author and Wise, we show that every non-arithmetic lattice in PSL$(2,\mathbb{C})$ is the full group of orientation-preserving isometries for some other lattice and that the orientation-preserving isometry group of a finite-volume hyperbolic 3-manifold acts non-trivially on the homology of some finite-sheeted cover., Comment: 11 pages

Federated recommender systems (FedRecs) have emerged as a popular research direction for protecting users' privacy in on-device recommendations. In FedRecs, users keep their data locally and only contribute their local collaborative information by uploading model parameters to a central server. While this rigid framework protects users' raw data during training, it severely compromises the recommendation model's performance due to the following reasons: (1) Due to the power law distribution nature of user behavior data, individual users have few data points to train a recommendation model, resulting in uploaded model updates that may be far from optimal; (2) As each user's uploaded parameters are learned from local data, which lacks global collaborative information, relying solely on parameter aggregation methods such as FedAvg to fuse global collaborative information may be suboptimal. To bridge this performance gap, we propose a novel federated recommendation framework, PDC-FRS. Specifically, we design a privacy-preserving data contribution mechanism that allows users to share their data with a differential privacy guarantee. Based on the shared but perturbed data, an auxiliary model is trained in parallel with the original federated recommendation process. This auxiliary model enhances FedRec by augmenting each user's local dataset and integrating global collaborative information. To demonstrate the effectiveness of PDC-FRS, we conduct extensive experiments on two widely used recommendation datasets. The empirical results showcase the superiority of PDC-FRS compared to baseline methods.

An image denoiser can be used for a wide range of restoration problems via the Plug-and-Play (PnP) architecture. In this paper, we propose a general framework to build an interpretable graph-based deep denoiser (GDD) by unrolling a solution to a maximum a posteriori (MAP) problem equipped with a graph Laplacian regularizer (GLR) as signal prior. Leveraging a recent theorem showing that any (pseudo-)linear denoiser $\boldsymbol \Psi$, under mild conditions, can be mapped to a solution of a MAP denoising problem regularized using GLR, we first initialize a graph Laplacian matrix $\mathbf L$ via truncated Taylor Series Expansion (TSE) of $\boldsymbol \Psi^{-1}$. Then, we compute the MAP linear system solution by unrolling iterations of the conjugate gradient (CG) algorithm into a sequence of neural layers as a feed-forward network -- one that is amenable to parameter tuning. The resulting GDD network is "graph-interpretable", low in parameter count, and easy to initialize thanks to $\mathbf L$ derived from a known well-performing denoiser $\boldsymbol \Psi$. Experimental results show that GDD achieves competitive image denoising performance compared to competitors, but employing far fewer parameters, and is more robust to covariate shift.

We derive some estimates for stable minimal hypersurfaces in $R^{n+1}$. The estimates are related to recent proofs of Bernstein theorems for complete stable minimal hypersurfaces in $R^{n+1}$ for $3\le n\le 5$ by Chodosh-Li, Chodosh-Li-Minter-Stryker and Mazet. In particular, the estimates indicate that the methods in their proofs may not work for $n=6$, which is observed also by Antonelli-Xu and Mazet. The method of derivation in this work might also be applied to other problems., Comment: References have been updated

Deep learning (DL) models have shown significant potential in Alzheimer's Disease (AD) classification. However, understanding and interpreting these models remains challenging, which hinders the adoption of these models in clinical practice. Techniques such as saliency maps have been proven effective in providing visual and empirical clues about how these models work, but there still remains a gap in understanding which specific brain regions DL models focus on and whether these brain regions are pathologically associated with AD. To bridge such gap, in this study, we developed a quantitative disease-focusing strategy to first enhance the interpretability of DL models using saliency maps and brain segmentations; then we propose a disease-focus (DF) score that quantifies how much a DL model focuses on brain areas relevant to AD pathology based on clinically known MRI-based pathological regions of AD. Using this strategy, we compared several state-of-the-art DL models, including a baseline 3D ResNet model, a pretrained MedicalNet model, and a MedicalNet with data augmentation to classify patients with AD vs. cognitive normal patients using MRI data; then we evaluated these models in terms of their abilities to focus on disease-relevant regions. Our results show interesting disease-focusing patterns with different models, particularly characteristic patterns with the pretrained models and data augmentation, and also provide insight into their classification performance. These results suggest that the approach we developed for quantitatively assessing the abilities of DL models to focus on disease-relevant regions may help improve interpretability of these models for AD classification and facilitate their adoption for AD diagnosis in clinical practice. The code is publicly available at https://github.com/Liang-lt/ADNI.

Deploying Deep Neural Networks (DNNs) on different hardware platforms is challenging due to varying resource constraints. Besides handcrafted approaches aiming at making deep models hardware-friendly, Neural Architectures Search is rising as a toolbox to craft more efficient DNNs without sacrificing performance. Among these, the Once-For-All (OFA) approach offers a solution by allowing the sampling of well-performing sub-networks from a single supernet -- this leads to evident advantages in terms of computation. However, OFA does not fully utilize the potential memory capacity of the target device, focusing instead on limiting maximum memory usage per layer. This leaves room for an unexploited potential in terms of model generalizability. In this paper, we introduce a Memory-Optimized OFA (MOOFA) supernet, designed to enhance DNN deployment on resource-limited devices by maximizing memory usage (and for instance, features diversity) across different configurations. Tested on ImageNet, our MOOFA supernet demonstrates improvements in memory exploitation and model accuracy compared to the original OFA supernet. Our code is available at https://github.com/MaximeGirard/memory-optimized-once-for-all.

Phenotyping consists in applying algorithms to identify individuals associated with a specific, potentially complex, trait or condition, typically out of a collection of Electronic Health Records (EHRs). Because a lot of the clinical information of EHRs are lying in texts, phenotyping from text takes an important role in studies that rely on the secondary use of EHRs. However, the heterogeneity and highly specialized aspect of both the content and form of clinical texts makes this task particularly tedious, and is the source of time and cost constraints in observational studies. To facilitate the development, evaluation and reproductibility of phenotyping pipelines, we developed an open-source Python library named medkit. It enables composing data processing pipelines made of easy-to-reuse software bricks, named medkit operations. In addition to the core of the library, we share the operations and pipelines we already developed and invite the phenotyping community for their reuse and enrichment. medkit is available at https://github.com/medkit-lib/medkit

The integration of digital devices in modern vehicles has revolutionized automotive technology, enhancing safety and the overall driving experience. The Controller Area Network (CAN) bus is a central system for managing in-vehicle communication between the electronic control units (ECUs). However, the CAN protocol poses security challenges due to inherent vulnerabilities, lacking encryption and authentication, which, combined with an expanding attack surface, necessitates robust security measures. In response to this challenge, numerous Intrusion Detection Systems (IDS) have been developed and deployed. Nonetheless, an open, comprehensive, and realistic dataset to test the effectiveness of such IDSs remains absent in the existing literature. This paper addresses this gap by considering the latest ROAD dataset, containing stealthy and sophisticated injections. The methodology involves dataset labelling and the implementation of both state-of-the-art deep learning models and traditional machine learning models to show the discrepancy in performance between the datasets most commonly used in the literature and the ROAD dataset, a more realistic alternative.

Link Traversal queries face challenges in completeness and long execution time due to the size of the web. Reachability criteria define completeness by restricting the links followed by engines. However, the number of links to dereference remains the bottleneck of the approach. Web environments often have structures exploitable by query engines to prune irrelevant sources. Current criteria rely on using information from the query definition and predefined predicate. However, it is difficult to use them to traverse environments where logical expressions indicate the location of resources. We propose to use a rule-based reachability criterion that captures logical statements expressed in hypermedia descriptions within linked data documents to prune irrelevant sources. In this poster paper, we show how the Comunica link traversal engine is modified to take hints from a hypermedia control vocabulary, to prune irrelevant sources. Our preliminary findings show that by using this strategy, the query engine can significantly reduce the number of HTTP requests and the query execution time without sacrificing the completeness of results. Our work shows that the investigation of hypermedia controls in link pruning of traversal queries is a worthy effort for optimizing web queries of unindexed decentralized databases., Comment: 5 pages, 2 figures

Astronomical impacts by small solar system bodies (meteoroids, asteroids, comets, and transitional objects) are considered a mechanism for delivering amino acids and their polymerization to proteins in early Earth conditions. High-pressure torsion (HPT) is a new methodology to simulate such impacts and clarify the behavior of biomolecules. In this study, two amino acids, crystalline L-serine and L-glutamic acid that were detected in meteorites, are processed by HPT and examined by ex situ X-ray diffraction, Raman spectroscopy, nuclear magnetic resonance, Fourier transform infrared spectroscopy, and in situ mechanical shear testing. No polymerization, chemical reactions, or phase transformations are detected after HPT, indicating that the stability and presence of these two amino acids in meteorites are quite reasonable. However, some microstructural and mechanical changes like crystal size reduction to the nanometer level, crystal defect formation, lattice expansion by vacancy formation, and shear strength enhancement to the steady state are found which are similar to the behaviors reported in metals and ceramics after HPT processing.

Plastic waste entering the environment through landfilling or improper disposal poses substantial risks to ecosystems and human health. Photoreforming is emerging as a clean photocatalytic technology that degrades plastic waste to organic compounds while simultaneously producing hydrogen fuel. This study introduces high-pressure torsion (HPT), a severe plastic deformation (SPD) method, as an innovative technique to enhance the photoreforming of polypropylene (PP) plastic mixed with a brookite TiO2 photocatalyst. Hydrogen production systematically increases with the number of HPT turns, accompanied by the formation of valuable small organic molecules. The enhancement in photocatalytic activity is attributed to strain-induced defect formation in both catalysts and plastics, as well as the creation of catalyst/plastic interphases that enhance charge carrier transport between inorganic and organic phases. These findings reveal a new functional application for SPD in energy conversion and sustainability.

Photoreforming is a clean photocatalytic technology for simultaneous plastic waste degradation and hydrogen fuel production, but there are still limited active and stable catalysts for this process. This work introduces the brookite polymorph of TiO2 as an active photocatalyst for photoreforming with an activity higher than anatase and rutile polymorphs for both hydrogen production and plastic degradation. Commercial brookite successfully converts polyethylene terephthalate (PET) plastic to acetic acid under light. The high activity of brookite is attributed to good charge separation, slow decay and moderate electron trap energy, which lead to a higher generation of hydrogen and hydroxyl radicals and accordingly enhanced photo-oxidation of PET plastic. These results introduce brookite as a stable and active catalyst for the photoconversion of water contaminated with microplastics to value-added organic compounds and hydrogen.

Fast and accurate detection of light in the near-infrared (NIR) spectral range plays a crucial role in modern society, from alleviating speed and capacity bottlenecks in optical communications to enhancing the control and safety of autonomous vehicles through NIR imaging systems. Several technological platforms are currently under investigation to improve NIR photodetection, aiming to surpass the performance of established III-V semiconductor p-i-n (PIN) junction technology. These platforms include in situ-grown inorganic nanocrystals and nanowire arrays, as well as hybrid organic-inorganic materials such as graphene-perovskite heterostructures. However, challenges remain in nanocrystal and nanowire growth, large-area fabrication of high-quality 2D materials, and the fabrication of devices for practical applications. Here, we explore the potential for tailored semiconductor nanocrystals to enhance the responsivity of planar metal-semiconductor-metal (MSM) photodetectors. MSM technology offers ease of fabrication and fast response times compared to PIN detectors. We observe enhancement of the optical-to-electric conversion efficiency by up to a factor of ~2.5 through the application of plasmonically-active semiconductor nanorods and nanocrystals. We present a protocol for synthesizing and rapidly testing the performance of non-stoichiometric tungsten oxide (WO$_{3-x}$) nanorods and cesium-doped tungsten oxide (Cs$_y$WO$_{3-x}$) hexagonal nanoprisms prepared in colloidal suspensions and drop-cast onto photodetector surfaces. The results demonstrate the potential for a cost-effective and scalable method exploiting tailored nanocrystals to improve the performance of NIR optoelectronic devices.

This research compares large language model (LLM) fine-tuning methods, including Quantized Low Rank Adapter (QLoRA), Retrieval Augmented fine-tuning (RAFT), and Reinforcement Learning from Human Feedback (RLHF), and additionally compared LLM evaluation methods including End to End (E2E) benchmark method of "Golden Answers", traditional natural language processing (NLP) metrics, RAG Assessment (Ragas), OpenAI GPT-4 evaluation metrics, and human evaluation, using the travel chatbot use case. The travel dataset was sourced from the the Reddit API by requesting posts from travel-related subreddits to get travel-related conversation prompts and personalized travel experiences, and augmented for each fine-tuning method. We used two pretrained LLMs utilized for fine-tuning research: LLaMa 2 7B, and Mistral 7B. QLoRA and RAFT are applied to the two pretrained models. The inferences from these models are extensively evaluated against the aforementioned metrics. The best model according to human evaluation and some GPT-4 metrics was Mistral RAFT, so this underwent a Reinforcement Learning from Human Feedback (RLHF) training pipeline, and ultimately was evaluated as the best model. Our main findings are that: 1) quantitative and Ragas metrics do not align with human evaluation, 2) Open AI GPT-4 evaluation most aligns with human evaluation, 3) it is essential to keep humans in the loop for evaluation because, 4) traditional NLP metrics insufficient, 5) Mistral generally outperformed LLaMa, 6) RAFT outperforms QLoRA, but still needs postprocessing, 7) RLHF improves model performance significantly. Next steps include improving data quality, increasing data quantity, exploring RAG methods, and focusing data collection on a specific city, which would improve data quality by narrowing the focus, while creating a useful product.