The paper highlights legal misunderstandings in ML fairness definitions.
problem Misalignment between ML fairness definitions and legal concepts.
method Examples and comparative analysis of legal and ML terminology.
result Both communities need to learn from these tensions.
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.
Paper formalizes anti-discrimination law in automated systems.
problem Algorithmic discrimination in legal contexts.
method Decision-theoretic framework grounded in UK anti-discrimination law.
result Introduced 'conditional estimation parity' metric for ML fairness.
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.
In the legal domain it is important to differentiate between words in general, and afterwards to link the occurrences of the same entities. The topic to solve these challenges is called Named-Entity Linking (NEL). Current supervised neural networks designed for NEL use publicly available datasets for training and testi…
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).
The digitalization of the legal domain has been ongoing for a couple of years. In that process, the application of different machine learning (ML) techniques is crucial. Tasks such as the classification of legal documents or contract clauses as well as the translation of those are highly relevant. On the other side, di…
Study identifies and measures biases in legal case data.
problem Addressing representation biases and sentencing disparities in legal case data.
method Utilizes two regression models: a baseline and a fair judge model.
result Quantifies biases across demographic groups in criminal data from Cook County (Illinois).
Formulates LGFO to measure fair ML systems using legal signals.
problem Formally incompatible measures of unfairness in ML systems.
method Uses legal signals to measure social cost of unfairness.
result LGFO aligns with societal view of unfairness.
Insiders camouflage trading to balance wealth and stealth, avoiding legal penalties.
problem Legal penalties and insider trading among liquidity traders.
method Kyle-type model with a diverse spectrum of prosecution schemes.
result Existence and uniqueness of equilibria for large populations, with a stealth index revealing trading scale.
Paper presents LLM-enhanced contract metadata extraction.
problem Automatic detection and annotation of legal clauses in contracts.
method Integration of publicly available and proprietary datasets with advanced LLM methodologies.
result Substantial improvements in clause identification accuracy and efficiency.
Case Law has a significant impact on the proceedings of legal cases. Therefore, the information that can be obtained from previous court cases is valuable to lawyers and other legal officials when performing their duties. This paper describes a methodology of applying discourse relations between sentences when processi…
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.
Paper proposes GSSNMF for legal document classification and topic modeling.
problem Lack of methods that can both classify and model topics with guidance.
method Guided Semi-Supervised Non-negative Matrix Factorization (GSSNMF).
result Improves both classification accuracy and topic coherence.
Computable contracts simplify financial transactions and reduce legal costs.
problem Difficulty in querying, executing, and analyzing text-based financial contracts.
method Develop a Contract Definition Language and illustrate use cases.
result Substantial improvements in customer experience and cost reduction.
Federated learning improves bioinformatics by sharing data legally.
problem Lack of access to diverse data in bioinformatics.
method Combines data from multiple institutions legally.
result Federated learning accelerates clinical discovery and robust exploration.
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…
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.
New approach to counterfactual reasoning avoids demographic interventions.
problem Limitations of traditional counterfactual reasoning in AI systems.
method Backtracking counterfactual approach instead of interventional.
result Allows addressing social concerns without demographic interventions.
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.
Machine Learning community is recently exploring the implications of bias and fairness with respect to the AI applications. The definition of fairness for such applications varies based on their domain of application. The policies governing the use of such machine learning system in a given context are defined by the c…
Deep learning methods are often difficult to apply in the legal domain due to the large amount of labeled data required by deep learning methods. A recent new trend in the deep learning community is the application of multi-task models that enable single deep neural networks to perform more than one task at the same ti…
Offline RL algorithms protect privacy while learning from sensitive data.
problem Learning sensitive data in financial, legal, and healthcare applications.
method Differential privacy guarantees for offline RL algorithms.
result Provable prevention of privacy risks with strong learning bounds.
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.
LexNLP is an open source Python package focused on natural language processing and machine learning for legal and regulatory text. The package includes functionality to (i) segment documents, (ii) identify key text such as titles and section headings, (iii) extract over eighteen types of structured information like dis…
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…
Decentralized finance uses blockchain for $70B in assets, differing from traditional finance.
problem Ensuring compliance and security in decentralized finance.
method Systematic analysis of legal, economic, security, and privacy aspects.
result Decentralized finance offers unique economic effects and security features.
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…
Survey examines public views on facial recognition technology.
problem Public acceptance and privacy concerns with facial recognition.
method Cross-national survey of 4 countries.
result Public views vary significantly across countries.
Unified framework for fair classification with group-blindness/awareness guarantees.
problem Challenges in enforcing fairness and group-blindness in binary classification.
method Unified framework based on post-processing procedure, applicable to various group fairness notions.
result Minimax rate-optimality of the proposed algorithm with controlled excess risk.
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.
Notions of compatible and almost compatible pseudo-Riemannian metrics, which are motivated by the theory of compatible (local and nonlocal) Poisson structures of hydrodynamic type and generalize the notion of flat pencil of metrics, are introduced and studied.
Defines compatibility between Jacobi structures and pseudo-Riemannian metrics on Jacobi algebroids.
problem Generalizing compatibility between Poisson and pseudo-Riemannian metrics to Jacobi structures.
method Introduces and studies compatibility conditions for Jacobi structures and pseudo-Riemannian metrics on Jacobi algebroids.
result Compatibility conditions are preserved under Poissonization and equivalent to Sasakian structures for contact pseudo-metrics.
Proposes a secure communication method independent of eavesdropper's decoder.
problem Lack of practical security constraints in existing methods.
method Dual MINE-based neural secure communications model.
result Security performance is not affected by eavesdropper's decoding means.
The paper characterizes compatible linear connections on 3D Finsler manifolds.
problem Characterizing compatible linear connections on Finsler manifolds of dimension three.
method Intrinsic method to characterize compatible linear connections, focusing on indicatrices and Euclidean symmetries.
result If a compatible linear connection is not unique, indicatrices must be Euclidean surfaces of revolution.
This paper systematizes knowledge on synthetic assets in crypto.
problem Disparate academic literature on synthetic assets in crypto.
method Broad perspective, general framework, data-driven analyses.
result Highlights risks and areas of research interest in synthetic assets.
The paper proposes reusable network components by making them compatible across tasks.
problem Training networks for different tasks independently leads to incompatible components.
method The paper splits a network into a features extractor and a target task head, and proposes various approaches to make them compatible.
result The proposed methods produce components that are directly compatible without compromising accuracy on original tasks.
Proves compatibility of light cones and projective structures.
problem Clarifying different concepts of compatibility between conformal and projective structures.
method Analyzes compatibility criteria introduced by Ehlers-Pirani-Schild and Trautman-Scholz.
result Proves that the compatibility criterion introduced by Ehlers-Pirani-Schild is correct.
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.
The paper investigates compatible linear connections on Randers spaces and finds a unique extremal connection.
problem Investigating compatible linear connections on Randers spaces.
method Transformed compatibility equations by taking torsion components as variables and determined when these equations have solutions.
result Characterized Randers spaces as non-Riemannian generalized Berwald spaces with a positive constant norm of perturbing term.
The paper studies properties of group relations induced by compatible coarse structures.
problem Properties of asymptotic resemblance relations on groups.
method Generalization of asymptotic dimension and introduction of set theoretic coupling.
result Groups with compatible coarse structures that admit a set theoretic coupling are asymptotic equivalent.
Derdzinski and Shen's theorem on the restrictions posed by a Codazzi tensor on the Riemann tensor holds more generally when a Riemann-compatible tensor exists. Several properties are shown to remain valid in this broader setting. Riemann compatibility is equivalent to the Bianchi identity of the new "Codazzi deviation …
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.
The causal compatibility question asks whether a given causal structure graph -- possibly involving latent variables -- constitutes a genuinely plausible causal explanation for a given probability distribution over the graph's observed variables. Algorithms predicated on merely necessary constraints for causal compatib…
Compatibility equations adapted to magnetic geometry.
problem No specific problem stated; magnetic geometry is the setting.
method Established compatibility equations in magnetic geometry.
result Analogues of Gauss, Ricci, and Codazzi-Mainardi equations in magnetic geometry.