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

69137206274 · Jun 202019922001200920172026
48 results for Conflict graphs

The study extends Tutte's conflict graph concept to nonplanar graphs.

problem Understanding the structure of nonplanar graphs through conflict graphs.
method Defining a signed conflict graph for maximally planar subgraphs and analyzing their balance.
result For graphs with a flat embedding, every maximal planar subgraph has unbalanced conflict graphs if and only if the graph is intrinsically linked.

Study analyzes crude oil futures markets using visibility graphs to understand their structure and dynamics.

problem Understanding the structure and dynamics of crude oil futures markets during global challenges.
method Visibility graph analysis of daily and high-frequency data.
result Crude oil futures markets exhibit small-world properties and assortative mixing, with unique sensitivities to global disruptions.

Graph embedding learns low-dimensional representations for nodes in a graph and effectively preserves the graph structure. Recently, a significant amount of progress has been made toward this emerging research area. However, there are several fundamental problems that remain open. First, existing methods fail to preser…

2019-05-16abs ↗pdf ↗

SON-GOKU uses graph coloring to improve multi-task learning by partitioning tasks into compatible groups.

problem Gradient interference between conflicting multi-task learning objectives slows convergence and model performance.
method SON-GOKU computes gradient interference, constructs an interference graph, and applies greedy graph-coloring to partition tasks.
result SON-GOKU consistently outperforms baselines and state-of-the-art multi-task optimizers on six datasets.

The study analyzes and benchmarks graph conformal prediction methods.

problem Uncertainty quantification in graph node classification.
method Analysis and scaling of existing graph conformal prediction methods.
result Justified recommendations for future graph conformal prediction research.

New method separates graph structure from node attributes to recover lost signal.

problem Standard representation learning on attributed graphs merges incompatible metric spaces, leading to geometrically flawed alignment.
method Custom variational autoencoder that separates manifold learning from structural alignment.
result Transforms geometric conflict into interpretable structural descriptor, uncovering connectivity patterns and anomalies.

A distinction has been drawn in fair machine learning research between `group' and `individual' fairness measures. Many technical research papers assume that both are important, but conflicting, and propose ways to minimise the trade-offs between these measures. This paper argues that this apparent conflict is based on…

2019-12-14abs ↗pdf ↗

Signed Evidence Flow (SEF) combines fitted prediction with signed feature attributions to measure evidence conflict and stability.

problem Modern data analysis lacks mechanisms to show the clarity, conflict, or stability of evidence behind predictions.
method Signed Evidence Flow (SEF) combines fitted prediction with signed feature attributions.
result SEF measures conflict and stability, and shows that conflict can improve loss prediction beyond confidence.

Russia-Ukraine conflict impacts global agricultural futures and spot markets' extreme risks.

problem Impact of Russia-Ukraine conflict on global agricultural futures and spot markets' extreme risks.
method Analytical framework for tail dependence, Copula-CoVaR method, ARMA-GARCH-skewed Student-t model.
result The outbreak of the conflict intensified risks in the wheat market the most and showed significant asymmetries in extreme risk spillovers.

The paper uses conformal prediction for forecasting conflict sequences in Markov processes.

problem Forecasting future conflict states for national policy decisions.
method Conformal prediction on Markov processes for temporally-dependent data.
result Conformal prediction provides valid uncertainty quantification and robustness to model misspecification.

ASGN uses active semi-supervised learning to predict molecular properties efficiently.

problem Predicting molecular properties with scarce labeled data and high computational cost.
method ASGN combines a teacher-student framework with active learning to handle joint representation and property learning.
result ASGN achieves remarkable performance in property prediction on public datasets.

Automatic conflict detection has grown in relevance with the advent of body-worn technology, but existing metrics such as turn-taking and overlap are poor indicators of conflict in police-public interactions. Moreover, standard techniques to compute them fall short when applied to such diversified and noisy contexts. W…

2017-11-14abs ↗pdf ↗

This paper tackles multilingual speech processing by optimizing conflicting objectives hierarchically.

problem Training models for multilingual, multi-task speech processing is hampered by conflicting objectives.
method Investigates three multi-objective MSP formulations and introduces a lightweight layer-selection mechanism.
result A bi-level recipe outperforms standard flat optimization in state-of-the-art MSP models.

Enhances conformal prediction for better uncertainty estimates in armed conflict fatalities.

problem Lack of individual-level uncertainty estimates in existing forecasting models.
method Introduces bin-conditional conformal prediction (BCCP) to improve coverage rates across subsets of the outcome variable.
result Demonstrates improved local coverage and well-calibrated uncertainty estimates across various ranges of fatalities.

Prediction problems often admit competing models that perform almost equally well. This effect challenges key assumptions in machine learning when competing models assign conflicting predictions. In this paper, we define predictive multiplicity as the ability of a prediction problem to admit competing models with confl…

2019-09-14abs ↗pdf ↗

Hybrid model improves geopolitical conflict forecasting.

problem Forecasting geopolitical events from sparse, bursty data.
method Sparse Temporal Fusion Transformer (TFT) + Variational Nearest Neighbor Gaussian Process (VNNGP).
result Consistently outperforms standalone TFT in long-range horizons.

We present CYCLADES, a general framework for parallelizing stochastic optimization algorithms in a shared memory setting. CYCLADES is asynchronous during shared model updates, and requires no memory locking mechanisms, similar to HOGWILD!-type algorithms. Unlike HOGWILD!, CYCLADES introduces no conflicts during the par…

2016-05-31abs ↗pdf ↗

Study examines grain futures connectedness during Russia-Ukraine conflict.

problem Quantile return connectedness of grain futures markets during geopolitical instability.
method Dynamic quantile VAR combined with frequency-domain decomposition.
result Heterogeneous spillovers across quantiles, with strong transmitters and persistent receivers.

WISCA generates consensus explanations from conflicting model-agnostic interpretability methods.

problem Conflicting explanations from diverse interpretability algorithms.
method WISCA integrates class probability and normalized attributions to generate consistent explanations.
result WISCA consistently aligns with the most reliable individual method, improving explanation reliability.

Flaky performance found in GNN SSL on RDBs, leading to worse linear evaluation.

problem Downstream task performances of GNN SSL on RDBs are poor.
method Proposed InfoNode to maximize mutual information between initial and final node representations.
result InfoNode improves GNN SSL performance on RDBs, supporting conjecture of conflict between SSL and GNN message passing.

Conflict sets are loci of intersecting wavefronts emanating from ll different surfaces. We show that generically conflict sets are Legendrian: locally they admit the structure of wavefronts. Simple stable singularities for this problem in Rn\R^n occur when 0nl40 \leq n-l \leq 4. Other related sets, such as kite curves a…

2002-09-12abs ↗pdf ↗

Researchers develop a neural network that learns like humans, overcoming forgetting and structure issues.

problem Catastrophic forgetting and structure limitations in neural networks.
method Memory playback strategy and dynamic structure extension using conditional variational autoencoder (CVAE).
result The method effectively prevents forgetting and allows for dynamic network growth.

The study analyzes implicit biases in neural networks using backward error analysis.

problem Analyzing implicit biases in multitask and continual learning settings.
method Backward error analysis to compute implicit training biases, deriving modified losses with three terms.
result The conflict term, measuring gradient alignment, is a new quantity in continual learning.

The study analyzes the conflict between group fairness and individual fairness in machine learning.

problem The conflict between group fairness (optimal statistical parity) and individual fairness in machine learning.
method Established sufficient conditions for the compatibility between optimal statistical parity and individual fairness requirements.
result Identified regions along the Pareto frontier that satisfy individual fairness requirements.

Introduces Rashomon Capacity to measure predictive multiplicity in probabilistic classifiers.

problem Predictive multiplicity in classification models leading to unjustified decisions.
method Introduces Rashomon Capacity, a metric for probabilistic classifiers, and provides a rigorous derivation.
result Rashomon Capacity captures nuanced score variations and provides strategies for disclosing conflicting models.

MultiImport infers node importance from multiple KG signals.

problem Inferring node importance in a knowledge graph from multiple input signals.
method End-to-end latent variable model using attentive graph neural networks.
result MultiImport consistently outperforms existing methods, achieving up to 23.7% higher NDCG@100.

MAMBA learns policies competitive with multiple conflicting oracles.

problem Learning policies from multiple conflicting oracles in reinforcement learning.
method MAMBA uses a gradient estimator in the style of GAE to optimize policies, leveraging demonstrations from multiple weak oracles.
result MAMBA outperforms the state-of-the-art in learning policies competitive with multiple conflicting oracles.

Entity resolution seeks to merge databases as to remove duplicate entries where unique identifiers are typically unknown. We review modern blocking approaches for entity resolution, focusing on those based upon locality sensitive hashing (LSH). First, we introduce kk-means locality sensitive hashing (KLSH), which is b…

2018-10-11abs ↗pdf ↗

LLMs show biases in investment analysis, leading to unreliable recommendations.

problem LLMs face conflicts between pre-trained knowledge and real-time market data, leading to biases in investment analysis.
method Experimental framework to investigate emergent behaviors in LLMs, analyzing sector, size, and momentum biases.
result Distinct, model-specific biases observed, including a tendency to prefer technology stocks, large-cap stocks, and contrarian strategies.

AGFN improves causal discovery by integrating expert feedback and handling latent confounding.

problem Inaccurate causal discovery due to unreliable expert knowledge and latent confounding.
method Ancestral GFlowNet (AGFN) is a reinforcement learning algorithm that iteratively refines a policy based on noisy expert feedback to infer ancestral graphs.
result AGFN converges to the true ancestral graph given accurate expert responses and outperforms baselines in structural Hamming distance and Bayesian Information Criterion.

Proposes a new framework for uncertainty-aware LLM post-training.

problem Heterogeneous, conflicting data in large language models.
method α-Rényi variational framework for learning distributions over post-training parameters.
result Enables training examples to be softly routed across ensemble members, promoting model specialisation and providing uncertainty estimates.

Study compares MAPF and MARL algorithms for warehouse automation.

problem Optimizing multi-agent pickup and delivery in warehouse settings.
method Compared conflict-based search (MAPF) and shared experience actor-critic (MARL).
result Comprehensive benchmarking of MAPF and MARL in a simulated warehouse environment.

This paper consists of two parts. In the first one we study the behaviour of medial axes (skeletons) of closed sets in a connected complete Riemannian manifold M\mathcal{M} under deformations. The second one is devoted to a similar study of conflict sets. We apply a new approach to the deformation process. Instead of …

2016-02-17abs ↗pdf ↗