SearcharxivSearch

arXiv subjects

Brian Moore

Publications and source records attributed to Brian Moore.

7 recordsLinked to original sources

SWIM: Short-Window CNN Integrated with Mamba for EEG-Based Auditory Spatial Attention Decoding

In complex auditory environments, the human auditory system possesses the remarkable ability to focus on a specific speaker while disregarding others. In this study, a new model named SWIM, a short-window convolution neural network (CNN) integrated with Mamba, is proposed for identifying the locus of auditory attention (left or right) from electroencephalography (EEG) signals without relying on speech envelopes. SWIM consists of two parts. The first is a short-window CNN (SW$_\text{CNN}$), which acts as a short-term EEG feature extractor and achieves a final accuracy of 84.9% in the leave-one-speaker-out setup on the widely used KUL dataset. This improvement is due to the use of an improved CNN structure, data augmentation, multitask training, and model combination. The second part, Mamba, is a sequence model first applied to auditory spatial attention decoding to leverage the long-term dependency from previous SW$_\text{CNN}$ time steps. By joint training SW$_\text{CNN}$ and Mamba, the proposed SWIM structure uses both short-term and long-term information and achieves an accuracy of 86.2%, which reduces the classification errors by a relative 31.0% compared to the previous state-of-the-art result. The source code is available at https://github.com/windowso/SWIM-ASAD.

eess.AS

FiSTECH: Financial Style Transfer to Enhance Creativity without Hallucinations in LLMs

Recent trends in Generative AI have emerged towards fine-tuning foundational large language models (LLMs) to create domain-specific LLMs for automation and chatbot-like applications. Specialized applications for analytics-heavy domains such as Financial report generation require specific writing styles that comprise compound and creative sentences with minimized hallucinations. In this work, we explore the self-corrective auto-regressive qualities of LLMs to learn creativity in writing styles with minimal prompting. We propose a novel two-stage fine-tuning (FT) strategy wherein in the first stage public domain financial reports are used to train for writing styles while allowing the LLM to hallucinate. In the second stage the examples of hallucinations are manually corrected and further used to fine-tune the LLM. The finally trained LLM learns to generate specific financial report sections using minimal instructions and tabular data inputs while ensuring low fine-tuning costs. Our proposed two-stage fine-tuning boosts the accuracy of financial questions answering by two-folds while reducing hallucinations by over 50%. Also, the fine-tuned model has lower perplexity, improved ROUGE, TER and BLEU scores, higher creativity and knowledge density with lower uncertainty and cross entropy than base LLMs. Thus, the proposed framework can be generalized to train creativity in LLMs by first allowing them to hallucinate.

cs.CL

ERATTA: Extreme RAG for Table To Answers with Large Language Models

Large language models (LLMs) with retrieval augmented-generation (RAG) have been the optimal choice for scalable generative AI solutions in the recent past. Although RAG implemented with AI agents (agentic-RAG) has been recently popularized, its suffers from unstable cost and unreliable performances for Enterprise-level data-practices. Most existing use-cases that incorporate RAG with LLMs have been either generic or extremely domain specific, thereby questioning the scalability and generalizability of RAG-LLM approaches. In this work, we propose a unique LLM-based system where multiple LLMs can be invoked to enable data authentication, user-query routing, data-retrieval and custom prompting for question-answering capabilities from Enterprise-data tables. The source tables here are highly fluctuating and large in size and the proposed framework enables structured responses in under 10 seconds per query. Additionally, we propose a five metric scoring module that detects and reports hallucinations in the LLM responses. Our proposed system and scoring metrics achieve >90% confidence scores across hundreds of user queries in the sustainability, financial health and social media domains. Extensions to the proposed extreme RAG architectures can enable heterogeneous source querying using LLMs.

cs.AI

Hallucination-minimized Data-to-answer Framework for Financial Decision-makers

Large Language Models (LLMs) have been applied to build several automation and personalized question-answering prototypes so far. However, scaling such prototypes to robust products with minimized hallucinations or fake responses still remains an open challenge, especially in niche data-table heavy domains such as financial decision making. In this work, we present a novel Langchain-based framework that transforms data tables into hierarchical textual data chunks to enable a wide variety of actionable question answering. First, the user-queries are classified by intention followed by automated retrieval of the most relevant data chunks to generate customized LLM prompts per query. Next, the custom prompts and their responses undergo multi-metric scoring to assess for hallucinations and response confidence. The proposed system is optimized with user-query intention classification, advanced prompting, data scaling capabilities and it achieves over 90% confidence scores for a variety of user-queries responses ranging from {What, Where, Why, How, predict, trend, anomalies, exceptions} that are crucial for financial decision making applications. The proposed data to answers framework can be extended to other analytical domains such as sales and payroll to ensure optimal hallucination control guardrails.

cs.CL

Investigating dissociation pathways of nitrobenzene via mega-electron-volt ultrafast electron diffraction

As the simplest nitroaromatic compound, nitrobenzene is an interesting model system to explore the rich photochemistry of nitroaromatic compounds. Previous measurements of nitrobenzene's photochemical dynamics have probed structural and electronic properties, which, at times, paint a convoluted and sometimes contradictory description of the photochemical landscape. A sub-picosecond structural probe can complement previous electronic measurements and aid in determining the photochemical dynamics with less ambiguity. We investigate the ultrafast dynamics of nitrobenzene triggered by photoexcitation at 267 nm employing megaelectronvolt ultrafast electron diffraction with femtosecond time resolution. We measure the first 5 ps of dynamics and, by comparing our measured results to simulation, we unambiguously distinguish the lowest singlet and triplet electronic states. We observe ground state recovery within 160 +/- 60 fs through internal conversions and without signal corresponding to photofragmentation. Our lack of dissociation signal within the first 5 ps indicates that previously observed photofragmenation reactions take place in the vibrationally "hot" ground state on timescales considerably beyond 5 ps.

physics.chem-ph

The Minkowskian planar 4R mechanism

We characterize and classify completely the planar 4R closed chain working on the Minkowskian plane. Our work would open a new research direction in the theory of geometric designs: the classification and characterization of the geometric design of linkages working in non--Euclidean spaces.

math.MG

Dynamic balancing of planar mechanisms using toric geometry

In this paper, a new method to determine the complete set of dynamically balanced planar four-bar mechanims is presented. Using complex variables to model the kinematics of the mechanism, the dynamic balancing constraints are written as algebraic equations over complex variables and joint angular velocities. After elimination of the joint angular velocity variables, the problem is formulated as a problem of factorization of Laurent polynomials. Using toric polynomial division, necessary and sufficient conditions for dynamic balancing of planar four-bar mechanisms are derived.

math.AG