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.
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 new method improves maximum inner product search by locally decomposing residual vectors.
problem Maximum inner product search efficiency and accuracy.
method Local Orthogonal Decomposition (LOD) combined with multiscale quantization.
result LOD consistently achieves higher recall than previous methods under the same bitrates.
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.
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.
We formulate a family of spin Topological Quantum Filed Theories (spin-TQFTs) as fermionic generalization of bosonic Dijkgraaf-Witten TQFTs. They are obtained by gauging G-equivariant invertible spin-TQFTs, or, in physics language, gauging the interacting fermionic Symmetry Protected Topological states (SPTs) with a …
Measuring the similarity of two files is an important task in malware analysis, with fuzzy hash functions being a popular approach. Traditional fuzzy hash functions are data agnostic: they do not learn from a particular dataset how to determine similarity; their behavior is fixed across all datasets. In this paper, we …
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…
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.
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.
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.
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.
Nowadays, CAPTCHAs are computer generated tests that human can pass but current computer systems can not. They have common usage in various web services in order to be able to detect a human from computer programs autonomously. In this way, owners can protect their web services from bots. In addition to visual CAPTCHAs…
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.
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.
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.
Study on estimating invertible functions with minimax analysis.
problem Minimizing risk of estimating invertible functions on a plane.
method Introduce two types of L2-risks, derive lower and upper rates for minimax values, develop an asymptotically almost everywhere invertible estimator. result Invertibility does not reduce the complexity of the estimation problem in terms of the rate.
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%.
Local invertibility of higher order tensor transforms on compact manifolds.
problem Invertibility of higher order tensor transforms on compact manifolds.
method Local invertibility of transverse and mixed ray transforms of tensors on compact Riemannian manifolds.
result Local invertibility of transverse and mixed ray transforms of tensors for specific dimensions.
Study of strongly invertible Legendrian links in contact 3-space.
problem Characterizing and understanding strongly invertible Legendrian links.
method Equivariant analogs of basic results for strongly invertible and Legendrian links.
result Existence of maximal equivariant Thurston-Bennequin number for strongly invertible links.
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.
Study on invariant Seifert surfaces for strongly invertible knots, showing large gaps in genus.
problem Understanding gaps in genus between strongly invertible knots and their invariant Seifert surfaces.
method Analysis of invariant Seifert surfaces and proof of genus gaps, with variants of Edmonds' theorem.
result Gap between equivariant genus and usual genus can be arbitrarily large for strongly invertible knots.
Dirac operator invertibility proven for specific manifolds.
problem Invertibility of twisted Dirac operator on manifolds.
method Closed connected spin manifold with non-negative scalar curvature, flat Hilbert module bundle.
result Dirac operator is invertible under given conditions.
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.
Invertible networks help explain decisions and identify important features.
problem Interpreting and explaining the decisions of black-box neural networks.
method Two-stage approach: invertible transformation to feature space and linear classifier. Determining decision boundaries and feature importance using local linear models.
result Ability to explain decisions and identify important features in neural networks.
Table of symmetric diagrams for knots up to 10 crossings.
problem Finding symmetric diagrams for strongly invertible knots.
method Compilation of symmetric diagrams for knots up to 10 crossings.
result Similarity of transversal diagrams to symmetric union diagrams for strongly invertible knots.
Global invertibility proven for orientation-preserving maps without homeomorphic extension.
problem Global invertibility of orientation-preserving Sobolev maps.
method Avoiding homeomorphic extension, study of strictly orientation-preserving maps.
result Global invertibility can be achieved without homeomorphic extension.
Invertible neural networks with masked convolutions improve classification and generative models.
problem Building robust invertible neural networks for better model interpretability and generative tasks.
method Combining masked convolutions and iterative inversion methods to create invertible architectures.
result Invertible neural networks achieve competitive performance in classification and generative tasks.
HINT improves invertible neural networks for better density estimation and Bayesian inference.
problem Sparse Jacobians limit expressiveness in invertible neural architectures.
method Recursive hierarchical coupling within subsets of variables leads to dense, triangular Jacobian.
result HINT allows efficient sampling from joint and posterior distributions using a single network.
ISR creates analytical relationships from data via invertible maps.
problem Creating analytical relationships from datasets.
method Combines INNs and EQL, using invertible maps and sparsity promoting regularization.
result ISR can serve as a normalizing flow for density estimation and solve inverse problems.
Local invertibility of ray transforms on convex manifolds.
problem Invertibility of ray transforms on compact Riemannian manifolds with strictly convex boundary.
method Local invertibility results for transverse and mixed ray transforms of 1 and 1+1 tensors.
result Local invertibility of ray transforms near boundary points, leading to global results.
Deep invertible networks decode EEG signals better than chance.
problem Decoding brain signals from EEG data.
method Deep invertible networks for generating and classifying brain signals.
result Deep invertible networks generate realistic EEG signals and classify novel signals above chance.
This work tackles exploding inverses in INNs, revealing and mitigating their numerical non-invertibility.
problem Exploding inverses in INNs cause numerical non-invertibility, leading to failures in various tasks.
method Derived bi-Lipschitz properties of INN building blocks, proposed regularizers for local invertibility, and stable INN designs for global invertibility.
result Bi-Lipschitz properties and stable INN designs are crucial for addressing numerical non-invertibility.
Neural ODEs and i-ResNets can't approximate all continuous invertible functions.
problem Neural ODEs and i-ResNets' limitations in approximating continuous invertible functions.
method Proving the approximation capabilities of Neural ODEs and i-ResNets.
result Neural ODEs and i-ResNets can approximate homeomorphisms on a p-dimensional Euclidean space.
CF-INNs can approximate any invertible function, resolving a long-standing problem.
problem Whether CF-INNs can approximate any invertible function.
method Demonstrated CF-INNs are universal approximators for invertible functions by showing a convenient criterion.
result CF-INNs are universal approximators for invertible functions.
This work presents a novel approach to train invertible linear layers by adding rank-one perturbations.
problem Training invertible linear layers during optimization with gradient-based methods is challenging.
method Train rank-one perturbations and add them to weight matrices infrequently, keeping track of inverses and determinants.
result Invertible linear layers improve mixing and mode separation in normalizing flows.