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

Trend · papers per month

25.0%50.0%75.0%100.0% · Sep 199219922001200920172026
48 results for structured assumptions

The paper defines conditions for learning causal graphs from data with unobserved variables.

problem Learning causal graphs from data with unobserved variables.
method Formalizes constraint-based structure learning algorithms under conditions and assumptions.
result Natural family of algorithms output Markov equivalent graphs to the causal graph under faithfulness assumption.

Develops methods for constructing likelihoods and priors for Bayesian networks.

problem Learning parameters and structure of Bayesian networks from limited data.
method Introduces assumptions for constructing likelihoods and priors from small assessments.
result Allows construction of likelihoods and priors for a wide range of network structures.

The paper proposes using low rank assumption to improve causal structure learning in DAGs.

problem Challenges in learning causal structures in high-dimensional, non-sparse DAGs.
method Exploits low rank assumption of DAG adjacency matrix to adapt causal structure learning methods.
result Maximum rank is highly related to hubs, suggesting low rank for scale-free networks.

Paper relaxes independence assumption for non-centered data.

problem Failing to account for dependencies in data leads to model failures.
method Proposes 'Kronecker-sum-structured mean' assumption to relax zero-mean requirement.
result Models with nonconvex but unimodal log-likelihoods can be solved efficiently.

Paper proves stability of solutions for specific hyperbolic systems.

problem Stability of solutions to 2imes22 imes 2 hyperbolic conservation laws.
method Proof of generic structural stability using differential topology.
result Riemann solutions are preserved under perturbations of flux, left, and right states.

Study reward-free RL in non-linear settings, improving efficiency and removing assumptions.

problem Improving sample efficiency in reward-free reinforcement learning for non-linear function approximation.
method Proposed RFOLIVE algorithm for minimal structural assumptions, analyzed hardness results for reward-free and reward-aware exploration.
result Statistical efficiency and hardness results under various structural assumptions, no need for reachability or explorability assumptions.

New algorithm reduces regret in combinatorial causal bandits without graph structure.

problem Minimizing regret in combinatorial causal bandits without graph structure.
method Design of algorithms for binary general causal models and BGLMs without graph skeleton.
result Achieves O(TlnT)O(\sqrt{T}\ln T) expected regret for causal models and O(T23lnT)O(T^{\frac{2}{3}}\ln T) for BGLMs.

Distributions over rankings are used to model data in various settings such as preference analysis and political elections. The factorial size of the space of rankings, however, typically forces one to make structural assumptions, such as smoothness, sparsity, or probabilistic independence about these underlying distri…

2012-02-14abs ↗pdf ↗

Bayesian model selection improves causal discovery in complex datasets.

problem Identifying causal direction in Markov equivalence classes with realistic assumptions.
method Incorporating causal assumptions within Bayesian framework for model selection.
result Bayesian model selection outperforms previous methods on various datasets.

New DA method CIRM outperforms existing methods under structural causal model assumptions.

problem Improving prediction performance in domain adaptation with perturbed source and target data.
method Theoretical framework based on structural causal models to analyze and compare DA methods.
result CIRM method outperforms existing methods when covariates and label distributions are perturbed in target data.

Study conformal product structures on reducible Riemannian manifolds.

problem Characterize conformal product structures on compact reducible Riemannian manifolds.
method Analyzing technical assumptions and properties of conformal product structures.
result Under suitable conditions, underlying manifolds are either conformally flat or triple products.

We characterize distributional equivalence in latent-variable models with cycles.

problem Lack of an equivalence characterization for latent-variable causal models with cycles.
method Established graphical criterion for distributional equivalence and developed edge rank constraints.
result First equivalence characterization without structural assumptions for latent-variable models with cycles.

New algorithms solve stochastic variational inequalities without bounded variance assumption.

problem Solving stochastic variational inequalities without bounded variance assumption.
method Developed algorithms for two classes of problems: monotone and structured nonmonotone VIs.
result Oracle complexity of O(ε^-4) for solving VIs with unbounded domains and possibly unbounded variance.

SpinSVAR estimates SVAR models with sparse input, improving accuracy and scalability.

problem Estimating SVAR models with sparse input assumptions.
method SpinSVAR models input as independent Laplacian variables, enforcing sparsity and using least absolute error regression.
result SpinSVAR outperforms state-of-the-art methods in accuracy and runtime, identifying significant structural shocks.

New estimators reduce computation for Kendall's tau and conditional Kendall's tau matrices under structural assumptions.

problem Efficient estimation of Kendall's tau and conditional Kendall's tau matrices for large dimensions.
method Averaging pairwise estimates over blocks or conditional estimates, exploiting structural assumptions.
result Improved estimators with reduced computational cost and similar error level.

We identify direct causes of a target variable from observational data without full DAG identifiability.

problem Learning direct causes of a target variable from observational data.
method Developed algorithms under relaxed identifiability assumptions for one environment without interventions.
result Identifiable set of direct causes from observational data under specific assumptions.

Improved model for non-smooth signals with complex spectra.

problem Current models struggle with non-smooth signals and complex spectral structures.
method CGPCM and RGPCM models with causality and Bayesian nonparametric interpretations, improved variational inference.
result Proposed models show better performance on synthetic and real-world data.

New approach uses 'forward-looking' counterfactuals for treatment choice.

problem Using traditional 'retrospective' counterfactuals in treatment choice leads to counterintuitive results.
method Introduces 'counterfactual treatment choice' for forward-looking counterfactuals.
result Mismatches between interventional and forward-looking counterfactuals can lead to counterintuitive results.

New methods generalize nonlinear ICA beyond structural sparsity.

problem Identify true latent sources from nonlinear mixtures without structural sparsity assumptions.
method Propose identifiability results for undercomplete, partial sparsity, and flexible grouping structures.
result Prove identifiability in general settings of undercompleteness, partial sparsity, and flexible grouping structures.

Researchers identify latent variables and causal structures from nonlinear hierarchical models.

problem Challenging task of identifying latent variables and causal structures from observational data, especially when relationships are nonlinear.
method Investigated nonlinear latent hierarchical causal models, developed identification criterion, and constructed an estimation procedure.
result Identifiability of causal structures and latent variables achieved under mild assumptions.

This study validates BN structure learning algorithms under noisy data, revealing performance discrepancies.

problem Inconsistent performance claims across BN structure learning algorithms due to inconsistent evaluation methods.
method Applied 15 algorithms to noisy data in multiple studies, evaluating with various criteria.
result Traditional synthetic performance may overestimate real-world performance by 10-50%.

Proposes a partially linear structure to capture nonlinear relationships in mixture of experts models.

problem Suboptimal estimates due to linearity assumption in mixture of experts models.
method Introduces a partially linear structure that incorporates unspecified functions to capture nonlinear relationships.
result Establishes the identifiability of the proposed model under mild conditions and introduces a practical estimation algorithm.

New result on Einstein manifolds using conformal product structures.

problem Understanding Einstein metrics on product manifolds.
method Generalizing previous results on Einstein metrics on product manifolds to conformal product structures.
result Einstein metrics on conformal product structures of compact manifolds are also warped product metrics.

Study real logarithms of semi-simple matrices, focusing on differential structure.

problem Understanding the differential structure of real logarithms of semi-simple matrices.
method Examines the differential structure of real logarithms of semi-simple matrices under specific matrix types.
result Characterizes the differential structure of real logarithms of semi-simple matrices.

Proposes a new method for algorithmic recourse in confounded settings.

problem Provides actionable recommendations for individuals affected by automated decisions.
method Relaxes assumptions of no hidden confounding and additive noise, requiring only causal graph and confounding structure.
result Bounds the expected counterfactual effect of recourse actions, ensuring favourable outcomes in expectation.

Deep learning models converge to Gaussian dynamics with mixed structured inputs.

problem Understanding neural network dynamics with complex input distributions.
method Extended hidden manifold model to Gaussian mixtures, analyzed via SGD.
result Learning dynamics with mixed inputs converge to Gaussian behavior.

For compact Kählerian manifolds, the holomorphic pseudosymmetry reduces to the local symmetry if additionally the scalar curvature is constant and the structure function is non-negative. Similarly, the holomorphic Ricci-pseudosymmetry reduces to the Ricci-symmetry under these additional assumptions. We construct exampl…

2009-03-29abs ↗pdf ↗

Optimal reinsurance contracts for multiple dependent risks are derived without specific dependency assumptions.

problem Finding optimal reinsurance contracts for multiple dependent risks without assuming their dependency structure.
method Assumes maximal expected utility criterion and independent negotiation of reinsurance for each risk. Derives optimality conditions and shows that under mild assumptions, optimal contracts are classical (non-randomized) type.
result Optimal reinsurance contracts exist and can be classical (non-randomized) type under mild assumptions.

A standard technique for understanding underlying dependency structures among a set of variables posits a shared conditional probability distribution for the variables measured on individuals within a group. This approach is often referred to as module networks, where individuals are represented by nodes in a network, …

2014-05-11abs ↗pdf ↗

Proposes a differentiable structure learning framework for general binary data.

problem Limitations of existing methods in discrete data structure learning.
method Formulates a differentiable optimization task for arbitrary dependencies in general discrete models.
result Establishes identifiability of complete set of compatible parameters and structures under mild assumptions.

In this paper a new Bayesian model for sparse linear regression with a spatio-temporal structure is proposed. It incorporates the structural assumptions based on a hierarchical Gaussian process prior for spike and slab coefficients. We design an inference algorithm based on Expectation Propagation and evaluate the mode…

2017-04-27abs ↗pdf ↗

We tackle causal discovery in linear systems with measurement error and unobserved causes.

problem Causal discovery in linear systems with measurement error and unobserved causes.
method Characterization of identifiability based on the mixing matrix, proposing causal structure learning methods.
result The structure of causal models can be identified under certain faithfulness assumptions.