Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

169,051 papers · 148 categories

Trend · papers per month

1.9%3.8%5.8%7.7% · Jul 199419922001200920182026
48 results for legal texts

LexNLP processes legal and regulatory texts for structured information.

problem Processing structured information from legal and regulatory texts.
method Natural language processing and machine learning for legal and regulatory text.
result LexNLP extracts over eighteen types of structured information from legal and regulatory texts.

Hybrid approach combines topic and graph embeddings for legal document clustering.

problem Challenges in classifying legal texts due to domain-specific language and limited labeled data.
method Combines unsupervised topic and graph embeddings with a supervised model.
result Improves clustering quality over text-only or graph-only embeddings.

This paper predicts legal proceedings status using NLP and machine learning.

problem Classify Brazilian legal proceedings into archived, active, and suspended categories.
method Combined NLP techniques with machine learning to classify legal proceedings sequences.
result Achieved maximum accuracy of 93% and top average F1 Scores of 89% (macro) and 93% (weighted).

This study identifies sentence relationships in legal transcripts.

problem Improving understanding of legal case proceedings through sentence relationships.
method Combining machine learning and rule-based approach to classify sentence relationships.
result First study to use discourse relationships for legal court case transcripts.

Browsing and finding relevant information for Bangladeshi laws is a challenge faced by all law students and researchers in Bangladesh, and by citizens who want to learn about any legal procedure. Some law archives in Bangladesh are digitized, but lack proper tools to organize the data meaningfully. We present a text vi…

2017-11-14abs ↗pdf ↗

Causal discovery algorithms can help generate legal arguments.

problem Leveraging causal discovery algorithms in legal decision-making.
method Prepared a legal dataset, annotated with 17 legal concepts, applied causal discovery algorithms, and quantified degrees of belief.
result Some causal relationships help generate viable legal arguments.

Efficiently distills pretrained text-to-image models without real data, improving FID and CLIP scores.

problem Slow iterative refinement process of diffusion-based text-to-image models.
method Guided Score identity Distillation with Long and Short Classifier-Free Guidance.
result Achieves state-of-the-art FID performance with competitive CLIP score.

Smart Close-out Netting aims to automate close-out netting processes.

problem Inefficiencies in close-out netting processes for financial institutions.
method Standardisation and automation of legal and regulatory processes using a data-driven framework and controlled natural language.
result Standardisation and automation can improve close-out netting processes for prudentially regulated financial institutions.

Insider trading is reduced when penalized, affecting expected penalties in a non-monotone way.

problem Reducing insider trading behavior when insiders face legal penalties.
method Characterized via a backward stochastic differential equation (BSDE) with a non-linear operator.
result The insider's expected penalties are non-monotone in the fee structure and determined by relative entropy.

What does it mean for an algorithm to be biased? In U.S. law, unintentional bias is encoded via disparate impact, which occurs when a selection process has widely different outcomes for different groups, even as it appears to be neutral. This legal determination hinges on a definition of a protected class (ethnicity, g…

2014-12-11abs ↗pdf ↗

ClauseLens uses reinforcement learning to price reinsurance treaties transparently and auditably.

problem Opaque and difficult-to-audit reinsurance treaty pricing practices.
method ClauseLens models treaty pricing as a Risk-Aware Constrained Markov Decision Process (RA-CMDP), incorporating legal clauses and generating interpretable explanations.
result ClauseLens reduces solvency violations and improves tail-risk performance, achieving 88.2% accuracy in clause-grounded explanations.

GPT learns a causal world model from token predictions, validated in game sequences.

problem Does GPT implicitly learn a causal world model from token predictions?
method Derived a causal interpretation of GPT's attention mechanism and proposed zero-shot causal structure learning.
result GPT can generate legal next moves with high confidence for sequences with encoded causal structures, but fails for illegal moves.

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%.

Examines AI regulation in finance, highlighting risks and gaps in current laws.

problem Rapid AI adoption in finance introduces risks and compliance challenges.
method Reviews current legislation, industry guidelines, and real-world use cases.
result Need for adaptive, technology-neutral policies to balance innovation and consumer protection.

This paper develops a structural credit risk model to characterize the difference between the economic and recorded default times for a firm. Recorded default occurs when default is recorded in the legal system. The economic default time is the last time when the firm is able to pay off its debt prior to the legal defa…

2010-12-03abs ↗pdf ↗

New framework for contesting algorithmic decisions, not just explaining them.

problem Helping individuals review and correct erroneous algorithmic decisions.
method Operationalized contestability as a natural complement to explainable AI (XAI), identifying three types of evidence for reversal.
result Existing EU legislation already grants individuals legal rights to contest algorithmic decisions.

Proposes a deep learning model for probabilistic forecasting that is also interpretable.

problem Inability to explain predictions of neural network-based time series forecasting methods.
method Deep Autoregressive Networks (DANLIP) for locally interpretable probabilistic forecasting.
result DANLIP provides interpretable predictions with comparable performance to state-of-the-art methods.

Classifies privacy policy segments for better user understanding.

problem Difficulty in understanding privacy policies due to legal jargon.
method Uses machine learning and deep learning techniques to classify privacy policy segments.
result Identifies data practices in privacy policies for better user comprehension.

This research improves debt collection strategies using advanced machine learning.

problem Accurate estimation of propensity to pay and cashflow for optimal debt collection.
method Developed a machine learning framework with pre-processing and model selection.
result The proposed model outperforms current industry strategies.

This study categorizes RWA tokenization challenges and solutions.

problem Navigating the gap between on-chain deterministic code and off-chain probabilistic reality.
method Taxonomy and comparative analysis of RWA protocols, legal and technical standards.
result RWA tokenization requires overcoming legal and technical interoperability issues.

We introduce a topological combinatorial game called the Link Smoothing Game. The game is played on the shadow of a link diagram and legal moves consist of smoothing precrossings. One player's goal is to keep the diagram connected while the other player's goal is to disconnect the shadow. We make significant progress t…

2011-09-19abs ↗pdf ↗