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.

168,657 papers · 148 categories

Trend · papers per month

24487296 · Jun 202019922001200920172026
48 results for concept frustration

Geometric framework detects concept frustration between human concepts and machine representations.

problem Aligning human concepts with machine learning representations.
method Geometric framework and similarity measures for detecting concept frustration.
result Concept frustration affects machine learning model performance and reorganizes learned concept representations.

We introduce a minimal agent-based model to qualitatively conceptualize the allocation of limited wealth among more abundant opportunities. We study the interplay of power, satisfaction and frustration in distribution, concentration, and inequality of wealth. Our framework allows us to compare subjective measures of fr…

2015-10-02abs ↗pdf ↗

Dual decomposition provides a tractable framework for designing algorithms for finding the most probable (MAP) configuration in graphical models. However, for many real-world inference problems, the typical decomposition has a large integrality gap, due to frustrated cycles. One way to tighten the relaxation is to intr…

2012-10-16abs ↗pdf ↗

We show that the emergence of systemic risk in complex systems can be understood from the evolution of functional networks representing interactions inferred from fluctuation correlations between macroscopic observables. Specifically, we analyze the long-term collective dynamics of the New York Stock Exchange between 1…

2018-07-09abs ↗pdf ↗

Symmetry-electronic fingerprints reveal competing magnetic phases in two-dimensional materials.

problem Predicting magnetic ground states, moments, and anisotropy in two-dimensional magnets.
method Introduce the symmetry-electronic fingerprint (SEF), a physically interpretable representation that encodes crystallographic symmetry operations, Wyckoff-site geometry, and site-resolved electronic structure.
result SEF-trained models accurately classify magnetic ordering and regress moments alongside anisotropy energies.

Combinatorial auctions are formulated as frustrated lattice gases on sparse random graphs, allowing the determination of the optimal revenue by methods of statistical physics. Transitions between computationally easy and hard regimes are found and interpreted in terms of the geometric structure of the space of solution…

2006-05-25abs ↗pdf ↗

Unsupervised learning techniques in computer vision often require learning latent representations, such as low-dimensional linear and non-linear subspaces. Noise and outliers in the data can frustrate these approaches by obscuring the latent spaces. Our main goal is deeper understanding and new development of robust ap…

2017-07-31abs ↗pdf ↗

AI threatens financial stability through misuse and stealth adoption.

problem Misuse and stealth adoption of AI in financial regulations.
method Analysis of AI's potential risks and criteria for AI suitability.
result AI will likely become widely used by stealth, affecting high-level financial functions.

We have studied here the self-organising features of the dynamics of a model market, where the agents `trade' for a single commodity with their money. The model market consists of fixed numbers of economic agents, money supply and commodity. We demonstrate that the model, apart from showing a self-organising behaviour,…

2000-12-21abs ↗pdf ↗

The search of unconventional magnetic and nonmagnetic states is a major topic in the study of frustrated magnetism. Canonical examples of those states include various spin liquids and spin nematics. However, discerning their existence and the correct characterization is usually challenging. Here we introduce a machine-…

2018-04-23abs ↗pdf ↗

We propose a frustrated and disordered many-body model of a stockmarket in which independent adaptive traders can trade a stock subject to the economic law of supply and demand. We show that the typical scaling properties and the correlated volatility arise as a consequence of the collective behavior of agents: With th…

2000-08-31abs ↗pdf ↗

This paper introduces a new specialized algorithm for equilibrium Monte Carlo sampling of binary-valued systems, which allows for large moves in the state space. This is achieved by constructing self-avoiding walks (SAWs) in the state space. As a consequence, many bits are flipped in a single MCMC step. We name the alg…

2011-11-23abs ↗pdf ↗

The field of deep learning is experiencing a trend towards producing reproducible research. Nevertheless, it is still often a frustrating experience to reproduce scientific results. This is especially true in the machine learning community, where it is considered acceptable to have black boxes in your experiments. We p…

2019-06-11abs ↗pdf ↗

We examine the effect of clamping variables for approximate inference in undirected graphical models with pairwise relationships and discrete variables. For any number of variable labels, we demonstrate that clamping and summing approximate sub-partition functions can lead only to a decrease in the partition function e…

2015-10-01abs ↗pdf ↗

Machine Learning (ML) and Deep Learning (DL) innovations are being introduced at such a rapid pace that model owners and evaluators are hard-pressed analyzing and studying them. This is exacerbated by the complicated procedures for evaluation. The lack of standard systems and efficient techniques for specifying and pro…

2018-11-24abs ↗pdf ↗

The Dynamic Chain Event Graph (DCEG) is able to depict many classes of discrete random processes exhibiting asymmetries in their developments and context-specific conditional probabilities structures. However, paradoxically, this very generality has so far frustrated its wide application. So in this paper we develop an…

2018-08-17abs ↗pdf ↗

Tensor trains simplify solving complex PDEs efficiently.

problem Solving high-dimensional parabolic PDEs using traditional methods is computationally infeasible.
method Reformulate PDEs as backward stochastic differential equations and use tensor train format for compression and efficient computation.
result Tensor train methods achieve a good balance between accuracy and computational efficiency.

Simplex-valued data appear throughout statistics and machine learning, for example in the context of transfer learning and compression of deep networks. Existing models for this class of data rely on the Dirichlet distribution or other related loss functions; here we show these standard choices suffer systematically fr…

2020-02-20abs ↗pdf ↗

Paper investigates learnability of OOD detection under various conditions.

problem Learnability of OOD detection under different scenarios.
method Investigates PAC learning theory, proves impossibility theorems, and provides necessary and sufficient conditions.
result Some conditions for learnability of OOD detection may not hold in practical scenarios.

ECBMs unify concept-based interpretations in deep learning models.

problem Suboptimal final accuracy and lack of concept interaction and conditional dependencies.
method ECBMs use a set of neural networks to define joint energy, enabling concept correction and conditional dependency quantification.
result ECBMs achieve higher accuracy and richer concept interpretations compared to state-of-the-art methods.

MCD offers a complete model understanding for high-stake decisions.

problem Local model understanding in XAI methods is not sufficient for high-stake decisions.
method MCD extends concept-based methods to ensure global model understanding via multi-dimensional subspaces.
result MCD provides a complete model understanding, ensuring the model reasoning is related to the actual model.

Concept-driven OPE reduces variance in off-policy decision evaluation.

problem High variance in off-policy decision evaluation due to limited sample sizes.
method Integrating human-explainable concepts into OPE to reduce variance.
result Concept-based OPE estimators remain unbiased and reduce variance when concepts are known and predefined.

DCR improves interpretability of concept-based models by using neural networks to build rule structures.

problem Inability of concept-based models to provide transparent decision processes.
method DCR uses neural networks to build syntactic rule structures using concept embeddings and executes these rules on concept truth degrees.
result DCR improves interpretability by up to 25% on challenging benchmarks and discovers meaningful logic rules.

Concept bottleneck models enable concept manipulation for model interpretation.

problem Training models to directly predict labels without intermediate concepts.
method Train models to predict intermediate concepts at training time, then use these concepts to predict labels.
result Concept bottleneck models achieve competitive accuracy with standard models while enabling concept manipulation.

This review covers learning under concept drift, including detection, understanding, and adaptation.

problem Unforeseeable changes in data distribution over time impact machine learning performance.
method Reviews and analyzes methodologies and techniques for concept drift detection, understanding, and adaptation.
result Establishes a framework for learning under concept drift with three main components.

Proposes a simple method to represent and manipulate concepts using polynomials and moment statistics.

problem Lack of a mathematical framework to define and operate on concepts.
method Characterizes concepts as zero sets of polynomials and uses moment statistics for representation; proposes a dictionary-based method to learn hierarchical structures.
result Signature of concepts can be used to discover common structures and recursively produce higher-level concepts.

The study identifies latent concepts from diverse observations without assuming specific models.

problem Lack of general theoretical support for concept learning.
method Develops a nonparametric framework for identifying latent concepts from multiple classes of observations.
result Correctness guarantees for concept identification without parametric assumptions.

LCBM model improves image classification without human supervision.

problem Improving interpretability and generalization of unsupervised concept-based models.
method LCBM models concepts as random variables in a Bernoulli latent space, reducing the number of concepts without sacrificing performance.
result LCBM outperforms existing models in generalization and interpretability.

New methods identify concepts in trained embeddings reliably without human labels.

problem Identifying interpretable concepts in trained embedding spaces without human labels.
method Explicitly connecting concept discovery to PCA and ICA, proposing novel approaches for dependent concepts.
result Proven methods outperform competitors on a variety of experiments, achieving up to 29% better alignment with ground truth.

CREAM models enable concept-grounded predictions and interpretability.

problem Designing models that can encode and extend prior knowledge about concept-concept and concept-task relationships.
method Proposes a flexible and efficient framework (CREAMs) that encodes arbitrary CCC-C and CoYC o Y relationships, incorporating a side-channel for incomplete concept sets.
result CREAM models achieve competitive task performance while encouraging concept-grounded predictions, avoiding concept leakage and achieving black-box-level performance.

Generative concept representations have three major advantages over discriminative ones: they can represent uncertainty, they support integration of learning and reasoning, and they are good for unsupervised and semi-supervised learning. We discuss probabilistic and generative deep learning, which generative concept re…

2018-11-15abs ↗pdf ↗