AI framework predicts invoice dilution in supply chain finance.
problem Invoice dilution risk in supply chain finance.
method AI, machine learning, dynamic credit limits, real-time projections.
result Supplemental AI model improves prediction accuracy.
Research proposes a decentralized invoice discounting system using Kelly criterion.
problem Persistent funding gap for SMEs and inefficiencies in traditional factoring.
method Automated Market Maker (AMM) with Kelly criterion for premium calculation.
result Resilient decentralized system with optimal profit distribution policies.
Supply chains lend themselves to blockchain technology, but certain challenges remain, especially around invoice financing. For example, the further a supplier is removed from the final consumer product, the more difficult it is to get their invoices financed. Moreover, for competitive reasons, retailers and manufactur…
Machine learning improves invoice matching speed and accuracy.
problem Efficiently matching similar invoices from various businesses and organizations.
method Combining machine learning with string similarity functions on invoice datasets.
result Neural network and boosted decision tree outperformed existing solutions.
The procure to pay process (P2P) in large enterprises is a back-end business process which deals with the procurement of products and services for enterprise operations. Procurement is done by issuing purchase orders to impaneled vendors and invoices submitted by vendors are paid after they go through a rigorous valida…
In a simplified setting, we show how to price invoice non-recourse factoring taking into account not only the credit worthiness of the debtor but also the assignor's one, together with the default correlation between the two. Indeed, the possible default of the assignor might impact the payoff by means of the bankruptc…
EP algorithm for efficient feature selection in binary classification.
problem Sparse feature selection in binary classification.
method Statistical mechanics inspired expectation propagation (EP) on a diluted Bayesian classifier.
result EP is a robust and competitive algorithm in terms of variable selection, estimation accuracy, and computational complexity.
Hybridizes physical and data-driven methods for predicting physicochemical properties.
problem Predicting physicochemical properties accurately using limited data.
method Distills physical method predictions into a prior model and combines with sparse experimental data using Bayesian inference.
result Significant improvements in predicting activity coefficients at infinite dilution compared to baselines and ensemble methods.
Machine learning predicts phase behavior in active matter suspensions.
problem Predicting phase behavior in active matter systems using machine learning.
method Used deep learning techniques, including fully connected networks and graph neural networks, to predict motility-induced phase separation (MIPS) in ABP suspensions.
result Strong agreement between machine learning predictions and MIPS binodal from simulations, suggesting machine learning as an effective method for phase behavior determination.
QSD enhances deep network performance through biologically plausible dropout.
problem Overfitting in deep networks.
method Quantal Synaptic Dilution (QSD) model based on neuronal synapses.
result QSD outperforms standard dropout in various deep network architectures.
New neural network can learn multiple patterns at once.
problem Learning multiple patterns simultaneously in neural networks.
method Multitasking Hebbian Network (MHN) for parallel learning of sparse data-sets.
result MHN can handle multiple patterns hierarchically or in parallel, depending on dilution.
Mean field theory has been successfully used to analyze deep neural networks (DNN) in the infinite size limit. Given the finite size of realistic DNN, we utilize the large deviation theory and path integral analysis to study the deviation of functions represented by DNN from their typical mean field solutions. The para…
GMVAE improves open-set classification by clustering latent representations.
problem Improving open-set classification accuracy and robustness.
method Cooperative learning of reconstruction and clustering in the latent space of a GMVAE.
result Achieved an average F1 improvement of 29.5% in open-set classification.
Deep learning has become a powerful and popular tool for a variety of machine learning tasks. However, it is challenging to understand the mechanism of deep learning from a theoretical perspective. In this work, we propose a random active path model to study collective properties of deep neural networks with binary syn…
The performance of EM in learning mixtures of product distributions often depends on the initialization. This can be problematic in crowdsourcing and other applications, e.g. when a small number of 'experts' are diluted by a large number of noisy, unreliable participants. We develop a new EM algorithm that is driven by…
Progress in machine learning is measured by careful evaluation on problems of outstanding common interest. However, the proliferation of benchmark suites and environments, adversarial attacks, and other complications has diluted the basic evaluation model by overwhelming researchers with choices. Deliberate or accident…
ZeroS improves Transformers by adding negative weights, matching or beating softmax attention.
problem Limited performance of linear attention methods, especially in long context sequences.
method Proposes Zero-Sum Linear Attention (ZeroS) that removes the zero-order term and reweights zero-sum softmax residuals.
result ZeroS matches or exceeds standard softmax attention across various benchmarks, theoretically expanding representable functions.
Topology design optimization offers tremendous opportunity in design and manufacturing freedoms by designing and producing a part from the ground-up without a meaningful initial design as required by conventional shape design optimization approaches. Ideally, with adequate problem statements, to formulate and solve the…
New method targets relative risk heterogeneity in clinical trials.
problem Identifying treatment effects across subgroups with absolute risk differences.
method Modified causal forests using a novel node-splitting procedure based on relative risk.
result Relative risk causal forests can capture heterogeneity not detected by absolute risk methods.
A complementary label (CL) simply indicates an incorrect class of an example, but learning with CLs results in multi-class classifiers that can predict the correct class. Unfortunately, the problem setting only allows a single CL for each example, which notably limits its potential since our labelers may easily identif…
Capsule network has shown various advantages over convolutional neural network (CNN). It keeps more precise spatial information than CNN and uses equivariance instead of invariance during inference and highly potential to be a new effective tool for visual tasks. However, the current capsule networks have incompatible …
Adaptive kernel density estimation improves accuracy in high dimensions.
problem Challenges in high-dimensional density estimation with traditional methods.
method Pre-training a neural network to recommend location-adaptive kernels.
result Effective density estimation in high dimensions with improved accuracy.
Power-law portfolios improve diversification by scaling weights sub-linearly.
problem Optimization methods struggle with unstable pair correlations and non-Gaussian risk measures.
method Construct portfolios with penalty proportional to arbitrary order moment of returns, leading to sub-linear weight scaling.
result Infinite order power-law portfolios are perfectly diversified, improving diversification over Kelly portfolios.
SHAP Distance assesses semantic fidelity of synthetic tabular data.
problem Semantic fidelity of synthetic tabular data is not well evaluated.
method SHAP Distance, defined as cosine distance between global SHAP attribution vectors.
result SHAP Distance detects semantic discrepancies overlooked by standard measures.
Study finds short-term trading signals can enhance alpha in U.S. S&P 500 portfolios.
problem Traditional factor investing misses real-time market dislocations.
method Double-selection LASSO framework to control for fundamental factors and isolate trading signals.
result 17 distinct trading signals capture significant risk premiums and enhance portfolio diversification.
Theoretical analysis of data quality and synergies in LLMs.
problem Understanding why different training methods require different amounts of data.
method Theoretical analysis of transformers trained on a weight prediction task for linear regression.
result SFT excels on smaller datasets challenging for the pretrained model, while RL benefits from large, not overly difficult data.
Cyber security has grown up to be a hot issue in recent years. How to identify potential malware becomes a challenging task. To tackle this challenge, we adopt deep learning approaches and perform flow detection on real data. However, real data often encounters an issue of imbalanced data distribution which will lead t…
3D Convolutional Neural Networks are sensitive to transformations applied to their input. This is a problem because a voxelized version of a 3D object, and its rotated clone, will look unrelated to each other after passing through to the last layer of a network. Instead, an idealized model would preserve a meaningful r…
A new method detects distribution shifts faster than existing CTMs.
problem Detecting distribution shifts in data streams with contamination issues.
method Uses a fixed reference dataset to compare each new sample, avoiding contamination.
result Detects distribution shifts faster and more reliably than standard CTMs.
Transformer learns shipping costs more accurately than traditional methods.
problem Inaccurate shipping cost estimates lead to poor financial decisions.
method Proposes Rate Card Transformer (RCT) using self-attention to encode shipping information.
result Cost predictions made by RCT have 28.82% less error compared to GBDT models.
Survey on principles and challenges of interpretable machine learning.
problem Improving machine learning models' interpretability for high-stakes decisions.
method Identification and analysis of 10 technical challenges in interpretable machine learning.
result Identification of 10 technical challenges in interpretable machine learning.
This paper shows RBMs can maintain strong performance even after extreme pruning, but only if done early in training.
problem The computational and environmental costs of large neural networks.
method Investigating the performance of RBMs under extreme pruning conditions, inspired by the Lottery Ticket Hypothesis.
result RBMs can achieve high-quality generative performance even after 80% pruning, but performance degrades sharply above a critical point.
GNN-CL model improves financial fraud detection using graph neural networks and reinforcement learning.
problem Complex financial fraud detection with high false positive rates.
method Combines GNN, CNN, LSTM, and MLPS to analyze transaction patterns and uses reinforcement learning to filter out noise.
result GNN-CL outperforms existing methods in financial fraud detection, reducing false positives.
Recently developed machine learning techniques, in association with the Internet of Things (IoT) allow for the implementation of a method of increasing oil production from heavy-oil wells. Steam flood injection, a widely used enhanced oil recovery technique, uses thermal and gravitational potential to mobilize and dilu…
A new framework evaluates deep learning vs classical forecasting methods for time series predictions.
problem Current forecasting model evaluation metrics fail to capture model performance differences.
method Proposes a novel framework for evaluating univariate time series forecasting models from multiple perspectives.
result Deep learning models like NHITS outperform classical methods in multi-step ahead forecasting but not in anomaly handling.
ModelRadar evaluates forecasting models across multiple aspects.
problem Evaluating forecasting models using single scores hides relevant performance variations.
method ModelRadar, a framework for aspect-based evaluation of univariate time series forecasting models.
result NHITS performs best overall but its superiority varies with forecasting conditions.
New metrics CWSA and CWSA+ improve model evaluation under confidence thresholds.
problem Lack of metrics capturing model reliability under confidence thresholds.
method Introducing CWSA and CWSA+ metrics that reward confident accuracy and penalize overconfident mistakes.
result CWSA and CWSA+ outperform classical metrics in trust-sensitive tests.
NN-GPR improves climate model predictions by preserving fine-scale spatial information.
problem Dilution of fine-scale spatial information and bias in model averaging.
method Gaussian process regression with an infinitely wide deep neural network.
result NN-GPR produces more accurate and detailed climate projections.
Modeling bank portfolio risk under climate transition impacts.
problem Evaluating risk measures for a bank's collateralized loans in a climate transition economy.
method Developed an end-to-end modeling framework using stochastic processes and dynamic macroeconomic variables.
result Derived expressions for risk measures as functions of climate transition parameters.
FPPI selectively uses predictions to improve inference efficiency.
problem Improving statistical inference with limited labeled data and heterogeneous prediction quality.
method Filtered Prediction-Powered Inference (FPPI) framework.
result FPPI achieves strictly improved asymptotic efficiency compared to existing methods.
This work optimizes signal estimation for sparse MRA with collision-free signals.
problem Recovering an unknown signal from repeated observations under cyclic isometries with high noise.
method Investigates minimax optimality for collision-free signals in the MRA model.
result The minimax optimal rate of estimation is \( \sigma^2/\sqrt{n} \) for sparse MRA.
New digital currency aims for equal wealth distribution.
problem Inequality in cryptocurrency wealth distribution.
method Egalitarian coin minting and joint minting across communities.
result Achieves global distributive justice in wealth distribution.
New method detects watermarks in LLM-generated text with human edits.
problem Dilution of watermark signals by human edits on LLM-generated text.
method Truncated goodness-of-fit test (Tr-GoF) for robust detection.
result Tr-GoF achieves optimality in robust detection of Gumbel-max watermark.
AI predicts stock winners with 2.43 Sharpe ratio, but returns are highly concentrated.
problem Predicting stock returns with AI, focusing on identifying top winners.
method Deployed a state-of-the-art LLM to autonomously search the web for stock attractiveness, avoiding look-ahead bias.
result AI can generate alpha by identifying top winners, but returns are highly concentrated.
A new penalty-free method optimizes portfolios without quantum annealing penalties.
problem Optimizing portfolios with quantum annealing penalties.
method Removing the penalty term and using a classical feasibility projector.
result Significant reduction in chain-break fractions and post-processed regret.
Language models fail to process hallucinated responses, and this study diagnoses the failure.
problem Language models fail to process hallucinated responses, leading to over-concentration or diffuse attention.
method The study uses forced scoring of benchmark-labeled responses to compute attention shapes and analyze the symmetric component of the degree-normalized attention operator.
result The study proves that every transpose-invariant spectral diagnostic of the attention operator is orientation-blind and bounds the sensitivity of any Lipschitz diagnostic by the asymmetry coefficient \(G\).
New algorithms for hypothesis testing in high-dimensional data are shown to be effective under various noisy conditions.
problem Testing high-dimensional probability measures under noisy conditions.
method Low coordinate degree functions (LCDF) using Efron-Stein decomposition.
result LCDF can effectively test high-dimensional probability measures under noisy channels, with efficacy depending on scalar Fisher information.
New findings show sparse signals in MRA model require fewer measurements than previously thought.
problem Learning an unknown signal from repeated noisy images under group actions.
method Enhanced probabilistic method and analysis of uniform uncertainty principles.
result Sparse signals exhibit intermediate σ4 sample complexity, improving over traditional σ2.