Fuzzy hashes learn from data to improve file similarity detection.
problem Measuring similarity between files, especially malware.
method Learned fuzzy hashes using a minimax training framework.
result Learned fuzzy hashes outperform traditional methods for file similarity.
Large language models learn company embeddings from SEC filings.
problem Lack of a rigorous definition of company similarity.
method Pre-trained and finetuned large language models (LLMs) to learn embeddings from SEC filings.
result LLMs can reproduce GICS classifications and indicate similar financial performance.
Flexible log file parsing using HMM adapts to evolving content.
problem Dynamic log file processing with evolving content.
method Modeling frequent patterns into HMM for flexible log file parsing.
result High accuracy (over 99%) in parsing different system log files.
SIVF k-means algorithm speeds up sparse data clustering.
problem Efficiently clustering large-scale high-dimensional sparse data.
method Inverted-file structure for centroids, filter-based similarity reduction.
result SIVF achieves higher speed and lower memory consumption.
A model classifies music genres from MP3 files using metric learning and feature extraction.
problem Classifying music genres from MP3 files efficiently and accurately.
method Metric learning and feature extraction using MFCC and PCA.
result Promising results in classification accuracy compared to baseline algorithms.
New method tags malware for better understanding and identification.
problem Lack of detailed descriptions and relationships between malware samples.
method Deep learning model generates human-interpretable descriptions and similarity index.
result Correctly identifies more than 95% of eleven tag descriptions with a low false positive rate.
The paper uses machine learning to detect malicious executable files.
problem Detecting malicious executable files using static analysis.
method Pre-processing, cleaning, encoding, feature selection, and ensemble training of classifiers.
result An ensemble of classifiers effectively detects malicious executable files.
Model predicts trade volume changes from financial filings.
problem Improving financial market understanding through machine learning.
method Hierarchical Reformer model trained on SEDAR filings.
result Model can predict trade volume changes without explicit training.
In record linkage (RL), or exact file matching, the goal is to identify the links between entities with information on two or more files. RL is an important activity in areas including counting the population, enhancing survey frames and data, and conducting epidemiological and follow-up studies. RL is challenging when…
The application of deep recurrent networks to audio transcription has led to impressive gains in automatic speech recognition (ASR) systems. Many have demonstrated that small adversarial perturbations can fool deep neural networks into incorrectly predicting a specified target with high confidence. Current work on fool…
Solves the challenge of retrieving item-specific financial information from Form 10-Q filings.
problem Retrieving item-specific information from Form 10-Q filings with varying formats and machine-readable hierarchy.
method Complements a rule-based algorithm with a Convolutional Neural Network (CNN) image classifier to itemize 10-Q files.
result Demonstrates a generalized pipeline for rapid data retrieval from a large volume of textual data.
AI analyzes corporate ESG filings to identify key dimensions and investor reactions.
problem Lack of reliable ESG ratings systems in corporate filings.
method AI techniques to separate and measure ESG dimensions and investor responses.
result AI can improve ESG ratings systems by identifying key dimensions and investor reactions.
The study improves sentiment analysis of 10-K filings, revealing aggregation effects on accuracy and correlation with market outcomes.
problem Lack of sentiment analysis for 10-K filings, particularly for risk disclosures.
method Supervised lexicon-learning approach applied to 10-K filings and Item 1A risk-factor sections, trained against return and volatility labels at different levels of aggregation.
result Sentiment analysis of Item 1A sections performs better at the individual-firm level, while full-filing text is more accurate at sector and portfolio levels.
New architecture separates object state and behavior for better game dynamics.
problem Lack of systematicity in black-box models for dynamic environments.
method Factorizes declarative and procedural knowledge into object files and schemata.
result Improves generalization on environments with multiple object tokens.
AppStreamer reduces mobile game storage by predicting needed files.
problem Expanding storage needs of mobile games and apps.
method Predictive streaming of app files from cloud or edge servers.
result Reduces storage by 87% for Dead Effect 2 and 86% for Fire Emblem Heroes.
A new method for energy-efficient file delivery in small cell networks.
problem Efficient resource management in femto-caching with time-variant statistical properties.
method Formulates a resource allocation problem as a stochastic knapsack problem and a multi-armed bandit problem, developing solutions for each.
result The proposed method maximizes the accumulated utility over the horizon, especially suitable for networks with time-variant statistical properties.
Detecting PE malware files is now commonly approached using statistical and machine learning models. While these models commonly use features extracted from the structure of PE files, we propose that icons from these files can also help better predict malware. We propose an innovative machine learning approach to extra…
Fine-grained event tagging system for SEC 8-K filings improves precision to 96%.
problem Coarse SEC item codes mislabel routine and significant events.
method Two-stage system tagging 8-K disclosures against a 119-event taxonomy.
result LLM judge finds precision rises to 96% with quality scores.
IVF k-means algorithm improves performance on large sparse data sets.
problem Efficiently clustering large-scale sparse data sets with numerous classes.
method Sparse data representation and inverted-file structure for high-speed and low-memory clustering.
result IVF achieves better performance than other algorithms on real document data sets.
Study uses LLM to extract and compare segment disclosures from financial filings.
problem Challenges in completeness and comparability of segment disclosures in financial reports.
method Developed a large language model framework to extract and preserve segment information from Form 10-K filings.
result The LLM accurately extracts segment-level information and addresses cross-period knowledge questions.
Detects bots in code commits and characterizes their activity.
problem Identifying and separating bot activity from human developers in code commits.
method BIMAN approach using author names, commit messages, files modified, and project associations.
result AUC-ROC value of 0.9 for bot detection.
This work proposes a meta-learning approach for better adaptation of source code models.
problem Adapting source code models to unseen local contexts.
method Formulated as a meta-learning problem, selecting targeted information for adaptation.
result Improved performance in code auto-completion tasks, especially for identifiers and literals.
IPO Finance Agent extends Finance Agent v2 for SpaceX S-1 filings, improving accuracy and cost-efficiency.
problem Evaluating IPO due diligence tasks with long-form documents.
method Extended task domain, improved agentic harness with contextual retrieval, automated rubric generation.
result Best-performing model reaches 79.8% accuracy, cost-efficient model at 77.2% with 0.05 USD per query.
FinReflectKG - EvalBench benchmarks financial KG extraction from SEC 10-K filings.
problem Lack of universal benchmark and evaluation framework for financial KG construction.
method Agentic and holistic evaluation principles, deterministic commit-then-justify judging protocol, binary and ordinal evaluations.
result Reflection-based extraction outperforms single-pass extraction in comprehensiveness, precision, and relevance.
SVM algorithm extracts digits from audio CAPTCHAs.
problem Recognizing audio CAPTCHAs from computer programs.
method Used RastaPLP features and SVM algorithm.
result Successfully extracted digits from audio CAPTCHAs.
Investor clusters analyzed in Helsinki Stock Exchange IPOs.
problem Lack of research on investor behavior in IPOs.
method Statistically validated network method to infer investor links based on trade timing.
result Large network structures form in IPO and mature companies, with evidence of institutional herding.
This paper provides a holistic study of how stock prices vary in their response to financial disclosures across different topics. Thereby, we specifically shed light into the extensive amount of filings for which no a priori categorization of their content exists. For this purpose, we utilize an approach from data mini…
Improved surname geocoding and name supplements enhance race imputation accuracy.
problem Census data problems affecting race imputation accuracy.
method Fully Bayesian Improved Surname Geocoding (fBISG) and name supplements.
result Significant improvement in race imputation accuracy across all racial groups.
Research explores how local communities and corporations interact in finance.
problem Impact of local government subsidies and corporate bankruptcy on bond yields.
method Difference-in-differences analysis, econometric models, deep-learning model.
result Corporate subsidies and bankruptcy filings affect bond yields significantly.
Paper presents a multi-label topic model for financial texts with high performance and insights into market reactions.
problem Analyzing financial text data for market reactions and understanding topic interactions.
method Trained a multi-label topic model on a financial text database, achieved high macro F1 score, and investigated topic interactions.
result Model achieves high performance (macro F1 > 85%) and reveals significant market reactions to topic co-occurrences.
Narrative disclosures in 10-K filings improve bankruptcy prediction beyond accounting ratios.
problem Traditional bankruptcy prediction models rely on accounting ratios, which may not capture early warning signals.
method Developed a PB Stress Score based on distress-specific language in 10-K narratives, evaluated against accounting and dictionary benchmarks.
result Adding the PB Stress Score increases AUC from 0.8323 to 0.9019 and improves top-decile bankruptcy capture from 44.12% to 64.71%.
A brief introduction to exterior differential systems for graduate students familiar with manifolds and differential forms. For complete files, see https://github.com/Ben-McKay/introduction-to-exterior-differential-systems
New AI stock indices classify firms' AI engagement using 10-K filings.
problem Opaque AI selection criteria in existing ETFs.
method NLP analysis of 10-K filings to classify AI stocks.
result Companies with higher AI engagement have greater positive returns.
IPO Finance Agent evaluates LLMs on SpaceX IPO due diligence, surpassing Finance Agent v2.
problem Evaluating language models on financial tasks like IPO due diligence.
method Introducing IPO Finance Agent and an evaluator-optimizer pipeline.
result The best-performing model reaches 79.4% accuracy at 0.30 USD per query.
Recent research has repeatedly shown that machine learning techniques can be applied to either whole files or file fragments to classify them for analysis. We build upon these techniques to show that for samples of un-labeled compiled computer object code, one can apply the same type of analysis to classify important a…
FinReflectKG builds a comprehensive financial knowledge graph from SEC filings, improving extraction quality.
problem Lack of large-scale, open-source financial knowledge graph datasets.
method Intelligent document parsing, table-aware chunking, schema-guided iterative extraction, reflection-driven feedback loop.
result Reflection-agent-based mode achieves best balance of efficiency, accuracy, and reliability.
We present a neural model for representing snippets of code as continuous distributed vectors ("code embeddings"). The main idea is to represent a code snippet as a single fixed-length code vector, which can be used to predict semantic properties of the snippet. This is performed by decomposing code to a col…
Proposes D2D-LSTM for predicting mobile social network content diffusion paths.
problem Lack of accurate content popularity prediction considering time and location in mobile social networks.
method D2D-LSTM, a deep neural network combining user social features and files features.
result Significantly improved prediction accuracy (up to 85.858%) and faster convergence (less than 100 steps).
Extracts StarCraft II tournament data for AI and ML studies.
problem Lack of accessible esports data for scientific use.
method Gathered and processed StarCraft II tournament replays using an API parser library.
result The largest publicly available StarCraft II esports dataset.
In recent years, the importance of deep learning has significantly increased in pattern recognition, computer vision, and artificial intelligence research, as well as in industry. However, despite the existence of multiple deep learning frameworks, there is a lack of comprehensible and easy-to-use high-level tools for …
Study evaluates five LLMs for financial report analysis, revealing performance differences and variability.
problem Lack of understanding in reliability, consistency, and transparency of LLMs in financial analysis.
method Human evaluation, automated similarity metrics, and behavioral diagnostics applied to five transformer-based LLMs over U.S. 10-K filings.
result No single LLM consistently dominates across all evaluation perspectives, highlighting variability and need for interpretability.
Evaluating the computational reproducibility of data analysis pipelines has become a critical issue. It is, however, a cumbersome process for analyses that involve data from large populations of subjects, due to their computational and storage requirements. We present a method to predict the computational reproducibili…
New model uses financial filings to predict bankruptcy, even without MDA sections.
problem Lack of complete MDA data limits traditional bankruptcy prediction models.
method Conditional Multimodal Discriminative (CMMD) model learns from accounting, market, and textual data.
result Empirical results show superior classification performance compared to traditional models.
Study uses LLMs to generate investor briefs from company reports and SEC filings.
problem Improving data analysis for individual investors.
method Preprocessed data, used gpt-4o model in RAG regime, evaluated by investors.
result LLMs can generate useful investor briefs from company reports and SEC filings.
Malware is constantly adapting in order to avoid detection. Model based malware detectors, such as SVM and neural networks, are vulnerable to so-called adversarial examples which are modest changes to detectable malware that allows the resulting malware to evade detection. Continuous-valued methods that are robust to a…
Paper presents ECL dataset for multi-modal bankruptcy prediction.
problem Developing models to predict corporate bankruptcy using textual and numerical data.
method Used ECL dataset to develop and evaluate classical and neural models.
result Textual and numerical data modalities complement each other for bankruptcy prediction.
The study analyzes trading imbalances from SEC Form 13F-HR filings to identify profitable trading opportunities.
problem Identifying profitable trading opportunities based on SEC Form 13F-HR filings.
method Statistical analysis of holdings variations and imbalances between consecutive reporting periods.
result A profitable trading strategy can be implemented by betting against the sign of imbalances with a 1-2 month time horizon.
Ludwig simplifies deep learning for non-experts.
problem Making deep learning accessible to non-experts.
method Type-based data abstraction and declarative configuration files.
result Ludwig democratizes deep learning, making it accessible to a broader audience.