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 level structures

This research tackles uncertainty estimation in autoregressive structured prediction tasks.

problem Ensuring safety and robustness of AI systems through accurate uncertainty estimation.
method Develops a unified probabilistic ensemble-based framework for token-level and sequence-level uncertainty estimation.
result Provides baselines for error and out-of-domain detection on translation and speech recognition datasets.

Bi-GNN models drug interactions using a bi-level graph approach.

problem Predicting drug-drug interactions using machine learning.
method Bi-level graph neural networks that consider both interaction graph and representation graphs of drugs.
result Bi-GNN model improves DDI prediction accuracy compared to existing methods.

Proposes a method to improve hierarchical clustering using set-level structural priors.

problem Lack of supervision for non-leaf structure in hierarchical clustering.
method Introduces set-level structural priors for semi-supervised hyperbolic hierarchical clustering.
result Improves label consistency and similarity-based tree quality over baselines.

Study on Chern-Simons theory at generic levels, revealing universal resurgent structure.

problem Analyzing Chern-Simons theory at generic levels with small boundary holonomy.
method Examined resurgent structure of state integral models on knot complements with generic discrete level.
result Resurgent structure is universal, independent of the level kk.

Improved prediction of hierarchical time series using structured regularization.

problem Making coherent forecasts for hierarchical time series.
method Structured regularization method for bottom-level time series predictions.
result Superior prediction accuracy and computational efficiency compared to previous methods.

The paper tackles multi-level fairness in algorithmic systems, addressing bias at both individual and structural levels.

problem Algorithmic systems can unfairly impact marginalized groups, especially when considering only individual-level bias.
method Formalizes multi-level fairness using causal inference tools, addressing effects of sensitive attributes at multiple levels.
result Illustrates the importance of accounting for macro-level sensitive attributes in fairness assessments.

A new method for solving complex sequential decision-making problems by decomposing them into multiple levels.

problem Sequential decision-making with natural multi-level structure.
method Multi-level meta-reinforcement learning with skill-based curriculum.
result Efficiently reduces stochasticity and policy search space, leading to fewer iterations and computations.

Any singular level of a completely integrable system (c.i.s.) with non-degenerate singularities has a singular affine structure. We shall show how to construct a simple c.i.s. around the level, having the above affine structure. The cotangent budle of the desingularised level is used to perform the construction, and th…

2008-07-30abs ↗pdf ↗

ISAHP discovers instance-level causal structures in event sequences.

problem Discovering fine-grained causal relationships in asynchronous, interdependent event sequences.
method ISAHP, a novel deep learning framework using self-attention mechanism.
result ISAHP meets Granger causality requirements and discovers complex causal structures.

BILBO optimizes bilevel problems without repeated lower-level optimizations.

problem Challenges in bilevel optimization, especially in noisy, constrained, and derivative-free settings.
method BILevel Bayesian Optimization (BILBO) that optimizes both levels simultaneously, using confidence-bounds and function query selection.
result Theoretical and empirical evidence of BILBO's effectiveness on various problems.

New methods test correlation between network structure and node features.

problem Assessing correlation between network structure and node-level covariates.
method Four novel methods based on linear models and canonical correlation analysis.
result Theoretical guarantees and computational efficiency for testing network dependency.

Paper explores generalization of AID-based bi-level optimization methods.

problem Uncertainty in generalization properties of AID-based bi-level optimization methods.
method Uniform stability analysis and convergence study of AID-based methods.
result AID-based methods can achieve similar generalization as single-level nonconvex problems.

GRAND ensures node-level differential privacy for network data.

problem Lack of node-level differential privacy for network data.
method Proposes GRAND, the first mechanism for releasing networks with node-level differential privacy and preserving structural properties.
result GRAND releases networks while ensuring node-level differential privacy and preserving structural properties.

Text documents are structured on multiple levels of detail: individual words are related by syntax, but larger units of text are related by discourse structure. Existing language models generally fail to account for discourse structure, but it is crucial if we are to have language models that reward coherence and gener…

2015-11-12abs ↗pdf ↗

Hierarchical analysis is considered and a multilevel model is presented in order to explore causality, chance and complexity in financial economics. A coupled system of models is used to describe multilevel interactions, consistent with market data: the lowest level is occupied by agents generating the prices of indivi…

2014-08-24abs ↗pdf ↗

These are the lecture notes for my course at the 2011 Park City Mathematics Graduate Summer School. The first two lectures covered the basics of the Torelli group and the Johnson homomorphism, and the third and fourth lectures discussed the second cohomology group of the level p congruence subgroup of the mapping class…

2012-01-18abs ↗pdf ↗

Model criticism tool evaluates text coherence and structure in generated long-form text.

problem Evaluate the high-level structure of generated text for coherence, coreference, and topicality.
method Apply model criticism in latent space to compare real and generated data distributions.
result Transformer-based models struggle with maintaining structural coherence and coreference.

Graph transformers outperform graph convolutions by preserving community information.

problem Understanding why graph transformers perform well in node-level prediction tasks.
method Analyzing the Gaussian process limits of graph transformers with infinite width and infinite heads.
result Graph transformers maintain discriminative node representations even in deep layers, preventing oversmoothing.

3D object recognition accuracy can be improved by learning the multi-scale spatial features from 3D spatial geometric representations of objects such as point clouds, 3D models, surfaces, and RGB-D data. Current deep learning approaches learn such features either using structured data representations (voxel grids and o…

2018-05-30abs ↗pdf ↗

For 4L4 \nmid L and gg large, we calculate the integral Picard groups of the moduli spaces of curves and principally polarized abelian varieties with level LL structures. In particular, we determine the divisibility properties of the standard line bundles over these moduli spaces and we calculate the second integral …

2009-08-04abs ↗pdf ↗

We applied Generative Adversarial Networks (GANs) to learn a model of DOOM levels from human-designed content. Initially, we analysed the levels and extracted several topological features. Then, for each level, we extracted a set of images identifying the occupied area, the height map, the walls, and the position of ga…

2018-04-24abs ↗pdf ↗

Selective prediction framework reduces errors in molecular structure identification from MS/MS.

problem High-stakes applications require reliable molecular structure identification from MS/MS data.
method Selective prediction framework using risk-coverage tradeoff and uncertainty quantification.
result First-order confidence measures and retrieval-level aleatoric uncertainty achieve strong risk-coverage tradeoffs.

Proposes a method for explaining black-box models with nested feature attributions.

problem Making black-box models transparent and trustworthy.
method Model-agnostic local explanation method exploiting nested feature structure and consistency property.
result Accurate and consistent HiFAs and LoFAs estimated using fewer model queries.

Let W -> A^2 be the universal Weierstrass family of cubic curves over C. For each N >= 2, we construct surfaces parametrizing the three standard kinds of level N structures on the smooth fibers of W. We then complete these surfaces to finite covers of A^2. Since W -> A^2 is the versal deformation space of a cusp singul…

2005-12-06abs ↗pdf ↗

Recent work has shown that a country's productive structure constrains its level of economic growth and income inequality. Here, we compare the productive structure of countries in Latin America and the Caribbean (LAC) with that of China and other High-Performing Asian Economies (HPAE) to expose the increasing gap in t…

2017-01-13abs ↗pdf ↗

Paper tackles efficient SGD methods for constrained bilevel optimization.

problem Stochastic bilevel optimization with equality constraints.
method Alternating implicit projected SGD and its variants.
result Achieves sample complexity matching state-of-the-art for unconstrained problems.

PACE explains ViTs by modeling patch-level concept distributions, surpassing existing methods.

problem Lack of trustworthy post-hoc explanations for Vision Transformers (ViTs)
method Variational Bayesian explanation framework (PACE)
result PACE surpasses state-of-the-art methods in meeting desiderata for ViT explanations.

In this paper, we develop a new aligned vertex convolutional network model to learn multi-scale local-level vertex features for graph classification. Our idea is to transform the graphs of arbitrary sizes into fixed-sized aligned vertex grid structures, and define a new vertex convolution operation by adopting a set of…

2019-02-26abs ↗pdf ↗

Topology-GS improves 3D GS for better structural and feature integrity.

problem Compromised pixel-level and feature-level integrity in 3D GS.
method Incorporates Local Persistent Voronoi Interpolation (LPVI) and PersLoss based on persistent homology.
result Topology-GS outperforms existing methods in PSNR, SSIM, and LPIPS metrics.

Complex systems can be modelled at various levels of detail. Ideally, causal models of the same system should be consistent with one another in the sense that they agree in their predictions of the effects of interventions. We formalise this notion of consistency in the case of Structural Equation Models (SEMs) by intr…

2017-07-04abs ↗pdf ↗

GenSDR tackles SDR by leveraging generative models to fully recover lower-dimensional structures.

problem Challenges in identifying low-dimensional sufficient structures in nonlinear SDR.
method Proposes GenSDR, a method that uses modern generative models to fully recover information in the central σ-field.
result Establishes consistency of GenSDR estimator for sample-level data and extends its applicability to non-Euclidean responses.