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,291 papers · 148 categories

Trend · papers per month

1.4%2.8%4.2%5.7% · Jun 202019922001200920182026
48 results for inconsistent nodes

Proposes methods to improve hierarchical classification accuracy by flattening inconsistent nodes.

problem Error propagation in top-down hierarchical classification due to inconsistent nodes.
method Data-driven approaches for identifying and flattening inconsistent nodes.
result Improves classification performance by up to 7% in Macro-F1 score.

A new metric assesses causal graphs using node permutations to detect inconsistencies.

problem Quantifying the goodness of causal graphs and distinguishing them from random graphs.
method Constructing a baseline through node permutations and comparing inconsistencies.
result The proposed metric can distinguish between true and wrong causal graphs.

The paper shows cross-validation fails in learning Gaussian graphical model structures.

problem Cross-validation's failure in learning Gaussian graphical model structures.
method Finite-sample bounds on misidentification probability of Lasso estimator.
result Cross-validation is inconsistent for learning Gaussian graphical model structures.

WP-SGD optimizes SGD for unevenly distributed data in distributed systems.

problem Inequalities in node performance and data consumption in parallel SGD.
method Combines weighted model parameters from different nodes to compensate for performance inconsistencies.
result WP-SGD significantly outperforms traditional parallel SGD in systems with uneven workloads.

New framework quantifies learning guarantees for inconsistent convex surrogates.

problem Analyzing consistency properties of machine learning methods with inconsistent convex surrogates.
method Extending the framework of Osokin et al. (2017) to inconsistent surrogates, introducing a new lower bound on the calibration function.
result Shows how learning with inconsistent surrogates can have guarantees on sample complexity and optimization difficulty.

The paper shows failure of smooth pasting principle in time-inconsistent stopping problems.

problem Time-inconsistent stopping problems with non-constant time preference rates.
method Analysis of the smooth pasting principle within the intra-personal game theoretic framework.
result The smooth pasting principle fails under time-inconsistency and does not guarantee equilibrium solutions.

Study solves HJB equations for time-inconsistent control problems.

problem Time-inconsistent deterministic linear quadratic control problems.
method Characterized solutions using Riccati equations with integral terms, proving uniqueness.
result Uniqueness of solutions to equilibrium HJB equations proved.

Study time-inconsistent consumption-investment in incomplete markets with general discount functions.

problem Time-inconsistent consumption-investment problems in incomplete markets.
method Coupled forward-backward stochastic differential equation approach.
result Uniqueness of open-loop equilibrium pair proved.

This paper tackles objective inconsistency in federated optimization with heterogeneous clients.

problem Objective inconsistency due to heterogeneity in clients' datasets and computation speeds.
method General framework for analyzing federated heterogeneous optimization algorithms, including FedAvg and FedProx, and proposing FedNova.
result FedNova eliminates objective inconsistency while preserving fast error convergence.

Study time-inconsistent portfolio optimization for competitive agents with relative performance criteria.

problem Time-inconsistent mean field and n-agent games under relative performance criteria.
method Construct open-loop equilibrium strategies for n-agent games and mean field games.
result Explicit solutions for n-agent games and mean field games, unique in a special class of equilibria.

Develops a reinforcement learning algorithm for learning deterministic equilibrium policies in time-inconsistent control problems.

problem Learning equilibrium policies in time-inconsistent control problems.
method Continuous-time model-free reinforcement learning algorithm using deterministic policy gradient approach.
result Learned equilibrium policies in general time-inconsistent control problems.

Recurrent models can produce infinite sequences, causing bias; new methods prevent this.

problem Inconsistency in decoding infinite-length sequences from recurrent language models.
method Defined and proved inconsistency of common decoding algorithms; proposed remedies.
result Proposed methods prevent inconsistency in practice.

Paper solves a complex portfolio selection problem with time-inconsistent preferences.

problem Time-inconsistent preferences in portfolio selection.
method Unified framework with minimal assumptions, proving existence and uniqueness of solution.
result Existence and uniqueness of square-integrable solution for the integral equation.

Study time-inconsistent control problems with model uncertainty, solving portfolio selection.

problem Time-inconsistent Markovian control problems under model uncertainty.
method Combining sub-game perfect strategies with adaptive robust stochastic methods.
result Solved numerically the mean-variance portfolio selection problem.

Aux-Net model handles dynamic systems with inconsistent inputs.

problem Inconsistent or unreliable input data in real-world scenarios.
method Aux-Net uses a weighted ensemble of classifiers and online gradient descent.
result Aux-Net provides scalable and agile online learning for dynamic systems.

A new model improves the performance of knowledge distillation in GNNs.

problem Inconsistent performance of existing knowledge distillation techniques in GNNs.
method Proposes a new model, Routing-by-Memory (RbM), a form of Mixture-of-Experts (MoE), to address performance concerns.
result Demonstrates experimentally that RbM achieves considerably more consistent performance across multiple datasets.

TWINs tackles PDA by weighting inconsistency between two networks.

problem PDA where target classes are a subset of source classes.
method Two Weighted Inconsistency-reduced Networks (TWINs) with two classification networks and weighted classification loss.
result TWINs outperforms other methods in PDA datasets.

Proposes a new multi-view graph learning framework to model consistency and inconsistency.

problem Graph learning methods often neglect inconsistency across multiple views, making them vulnerable to noisy datasets.
method Proposes a unified objective function to simultaneously model consistency and inconsistency, iteratively learning consistent and unified graphs.
result Demonstrates robustness and efficiency of the proposed approach on twelve multi-view datasets.

Separable losses are inconsistent for structured prediction models.

problem Inconsistency of separable losses in structured prediction models.
method Analysis of separable negative log-likelihood losses for structured prediction.
result Separable losses are not Bayes consistent and may not predict the most probable structure.

Paper proves existence and uniqueness of solutions to nonlocal systems, generalizing stochastic game theory.

problem Time inconsistency in stochastic differential games.
method Proves existence and uniqueness of solutions to nonlocal fully-nonlinear parabolic systems.
result Generalizes stochastic game theory to include time-inconsistent preferences.

The paper tackles inconsistency in removal-based explanations and proposes methods to reduce it.

problem Inconsistency in removal-based explanations.
method Established the Impossible Trinity Theorem and proposed two novel algorithms to minimize interpretation error.
result The proposed methods achieve a substantial reduction in interpretation error, up to 31.8 times lower.

Introduces strong equilibrium for time-inconsistent stopping problems in continuous time.

problem Time-inconsistent stopping problems in continuous time.
method Introduces strong equilibrium, compares with existing mild and weak equilibria, and provides an iteration method to construct optimal mild equilibria.
result Optimal mild equilibria are always strong equilibria under certain conditions.

We consider a general time-inconsistent stochastic linear-quadratic differential game. The time-inconsistency arises from the presence of quadratic terms of the expected state as well as state-dependent term in the objective functionals. We define an equilibrium strategy, which is different from the classical one, and …

2016-07-03abs ↗pdf ↗

The paper solves TIC LQ control problems using stochastic differential games.

problem Time-inconsistent linear-quadratic stochastic control problems.
method Stochastic differential games, spike variation approach.
result Achieves Nash equilibrium for TIC problems, demonstrating impact of ambiguity aversion.

The paper analyzes time-inconsistent strategies in financial markets with rough volatility.

problem Time-inconsistency in financial markets with rough volatility.
method Functional Itô calculus and game-theoretic framework to solve path-dependent Hamilton-Jacobi-Bellman equations.
result Explicit solutions to MVP problems under rough volatility, showing performance benefits.

New method detects inconsistencies in AHP matrices using triadic preference reversals.

problem Challenges in assessing consistency in AHP pairwise comparison matrices.
method Triadic preference reversals to detect inconsistencies between pairs of elements.
result 97% accuracy in detecting inconsistencies, significantly surpassing traditional methods.

The paper analyzes optimal dividend and capital injection strategies under time-inconsistent preferences.

problem Optimal dividend and capital injection strategies under time-inconsistent preferences.
method Diffusion risk model with general discount functions, weak equilibrium definition, HJB equation system.
result Explicit solutions and threshold types of optimal strategies derived under different discount functions.

This survey clarifies dynamic network terminology and reviews GNN models for dynamic networks.

problem Ambiguity in dynamic network terminology and lack of GNN models for dynamic networks.
method Established consistent terminology and notation for dynamic networks, reviewed GNN models.
result Comprehensive survey of dynamic graph neural network models.

Paper addresses inconsistency between offline and online LTR performance.

problem Inconsistency between offline and online LTR performance in E-commerce.
method Proposes an evaluator-generator framework to maximize evaluator score using reinforcement learning.
result Significant improvement in Conversion Rate (CR) over existing models.

Investigates time-inconsistent portfolio selection under MMV preferences.

problem Time-inconsistent optimal strategies for MMV preferences.
method Nash equilibrium controls for MMV and MV preferences, solving FBSDE and HJB equations.
result MMV optimal strategies lead to higher investment amounts than MV strategies, narrowing over time.

Empirical study shows consistent meta-RL algorithms adapt to OOD tasks.

problem Theoretical consistency of meta-RL algorithms and its practical implications.
method Empirical investigation of representative meta-RL algorithms, focusing on consistency and adaptation to out-of-distribution tasks.
result Theoretical consistent algorithms can adapt to OOD tasks, while inconsistent ones cannot, but can still fail for poor exploration.

Modeling complex systems with multi-resolution data and causal dependencies.

problem Accurate prediction of complex systems with varying causal dependencies and multi-resolution data.
method Score-based Variational Graphical Diffusion Model (Temporal-SVGDM) that constructs individual SDEs for each variable at its native resolution and couples them through a causal score mechanism.
result Improved prediction accuracy and causal understanding compared to existing methods, especially in temporal scenarios.

Introduces a new conditional expectation under distorted probabilities, addressing time-inconsistency.

problem Time-inconsistency in nonlinear expectations under probability distortion.
method Localizes probability distortion and constructs a time-consistent conditional expectation.
result Constructs a conditional expectation that is time-consistent and corresponds to a parabolic differential equation.