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

86172257343 · Jun 202019922001200920172026
48 results for Model-level representations

The paper extends statistical inference methods for black-box generative models.

problem Understanding and validating black-box generative models without access to their internal data.
method Develops model-level statistical inference tasks using generative model representations.
result Model-level representations are effective for multiple inference tasks.

Improves model classification accuracy in black-box settings.

problem Difficulty in inferring model properties due to limited query access.
method Introduces discriminative factorization to distinguish high-quality queries.
result Probability of chance-level classification decreases exponentially with query budget.

XGNN explains graph neural networks by generating graphs that maximize model predictions.

problem Lack of explainable models for graph neural networks.
method Train a graph generator to maximize model predictions, using reinforcement learning and graph rules.
result Generated graphs provide insights into how GNNs work and can guide model improvement.

Interpreting machine learning models helps understand adversarial attacks and defenses.

problem Understanding model vulnerability to adversarial attacks.
method Model interpretation techniques to explore adversarial attacks and defenses.
result Interpretation methods can be applied to adversarial attacks and defenses.

We propose a multifractal model for short-term interest rates. The model is a version of the Markov-Switching Multifractal (MSM), which incorporates the well-known level effect observed in interest rates. Unlike previously suggested models, the level-MSM model captures the power-law scaling of the structure functions a…

2011-11-22abs ↗pdf ↗

A framework evaluates the impact of different modules in graph contrastive learning.

problem Insufficient module-level evaluation in existing graph contrastive learning methods.
method Proposes a framework decomposing GCL models into four modules for module-level evaluation.
result Identifies module-level guidelines and competitive performance of different modules.

Complex black-box predictive models may have high accuracy, but opacity causes problems like lack of trust, lack of stability, sensitivity to concept drift. On the other hand, interpretable models require more work related to feature engineering, which is very time consuming. Can we train interpretable and accurate mod…

2019-02-28abs ↗pdf ↗

Generative model learns conditional distributions on collective variable levels.

problem Modeling conditional probability distributions on collective variable levels.
method General and efficient learning approach, data enrichment strategy.
result Effective generative models on different level-sets of collective variables.

Ensemble models provide more accurate feature importance estimates than single models.

problem Inaccurate variable importance estimates due to model instability and stochasticity.
method Theoretical analysis and validation on benchmarks and real data.
result Ensembling at the model level reduces excess risk and provides more accurate variable-importance estimates.

Convolutional neural networks (CNNs) have been increasingly deployed to edge devices. Hence, many efforts have been made towards efficient CNN inference in resource-constrained platforms. This paper attempts to explore an orthogonal direction: how to conduct more energy-efficient training of CNNs, so as to enable on-de…

2019-10-29abs ↗pdf ↗

XPER methodology decomposes credit scoring model performance.

problem Monitoring and understanding the key drivers of credit scoring model performance.
method XPER methodology based on Shapley values, decomposing performance metrics into feature contributions.
result A small number of features explain a large part of model performance.

While current machine learning models have impressive performance over a wide range of applications, their large size and complexity render them unsuitable for tasks such as remote monitoring on edge devices with limited storage and computational power. A naive approach to resolve this on the model level is to use simp…

2020-02-12abs ↗pdf ↗

A new framework for robustness analysis of deep neural networks using PAC-model learning.

problem Analyzing local robustness of deep neural networks.
method Black-box model learning with scenario optimisation to abstract DNN behaviour via an affine model with PAC guarantee.
result DeepPAC outperforms state-of-the-art statistical methods in practical robustness analysis.

This paper enhances the Random Survival Forest model for better predictive maintenance.

problem Improving time-to-failure estimation in predictive maintenance with Random Survival Forest.
method A three-level framework for quantifying hyperparameter tunability, including model-level and hyperparameter-level metrics.
result Hyperparameter tuning significantly improves Random Survival Forest model performance in predictive maintenance.

The rapid growth of data size and accessibility in recent years has instigated a shift of philosophy in algorithm design for artificial intelligence. Instead of engineering algorithms by hand, the ability to learn composable systems automatically from massive amounts of data has led to ground-breaking performance in im…

2016-02-13abs ↗pdf ↗

GCNs favor high-degree nodes, leading to biased performance; a new method mitigates this.

problem Degree-related biases in GCNs, especially for low-degree nodes.
method Developed a novel SL-DSGC that reduces model and data biases.
result SL-DSGC improves GCN accuracy significantly for low-degree nodes.

Proves EGF representations in specific geometric contexts.

problem Understanding representations of groups with hyperbolic properties.
method Analyzes projectively convex cocompact manifolds and convex projective manifolds with generalized cusps.
result Holonomy representations of specific geometric manifolds are EGF representations.

Study k-positive surface group representations and their degenerations.

problem Understanding the behavior of surface group representations under degenerations.
method Introduced k-positive representations and studied their degenerations using a limit theorem for positively ratioed representations.
result Degenerations of k-positive representations can lead to limits that are at least (k-3)-positive and irreducible limits are (k-1)-positive.

Develops theory of Anosov representations for Fuchsian groups, showing stability and analytical properties.

problem Understanding geometrically finite Fuchsian groups and their representations.
method Theory of Anosov representations, type-preserving deformations, limit maps, relative Anosov and dominated representations.
result Cusped Hitchin representations are Borel Anosov, stable under deformations, and limit maps vary analytically.

New representations defined for groups and graphs, with applications to stable representations.

problem Defining and constructing new types of representations for groups and graphs.
method Introducing (R,Λ)(R,Λ)-directed Anosov representations and using Fock-Goncharov positivity to construct them.
result Constructs large families of primitive stable representations from F2F_2 to PGL(V)\mathrm{PGL}(V), including non-discrete and non-faithful examples.

Study subgroup actions on mapping class groups using Heisenberg representations.

problem Untwisting representations of mapping class groups on Heisenberg subgroups.
method Restrict and analyze twisted representations of mapping class groups to Heisenberg subgroups.
result Untwisting representations on Torelli group for any Heisenberg representation.

Researchers describe unitary representations of mixed braid groups.

problem Understanding unitary representations of mixed braid groups.
method Explicitly describe unitary representations on cohomology of Abelian branched covers.
result Image of the representation is generated by complex reflections and related to the multivariate Burau representation.

This paper addresses law invariant coherent risk measures and their Kusuoka representations. By elaborating the existence of a minimal representation we show that every Kusuoka representation can be reduced to its minimal representation. Uniqueness -- in a sense specified in the paper -- of the risk measure's Kusuoka r…

2012-10-26abs ↗pdf ↗

A very popular problem on braid groups has recently been solved by Bigelow and Krammer, namely, they have found a faithful linear representation for the braid group B_n. In their papers, Bigelow and Krammer suggested that their representation is the monodromy representation of a certain fibration. Our goal in this pape…

2001-11-16abs ↗pdf ↗

Let S be a closed orientable surface of genus at least 2 and let G be a semisimple real algebraic group of non-compact type. We consider a class of representations from the fundamental group of S to G called positively ratioed representations. These are Anosov representations with the additional condition that certain …

2016-09-05abs ↗pdf ↗

In this paper, we introduce a study of prolongations of representations of Lie groups. We obtain a faithful (one-to-one) representation of TG where G is a finite-dimensional Lie group and TG is the tangent bundle of G, by using (not necessarily faithful) representations of G. We show that tangent functions of Lie group…

2013-10-08abs ↗pdf ↗

Paper addresses the disparity between sampled and mean representations in disentangled learning.

problem Disparity between sampled and mean representations in disentangled learning.
method Proposes a method to eliminate the disparity by proving and utilizing the relationship between total correlation of sampled and mean representations for multivariate normal distributions.
result Demonstrates that a factorized mean representation can have lower total correlation than the sampled representation.

New findings on cusped Borel Anosov representations and their properties.

problem Characterizing and understanding cusped Borel Anosov representations.
method Analyzing representations of lattices in PGL2(R)PGL_2(\mathbb{R}) to PGLd(R)PGL_d(\mathbb{R}).
result Cusped Borel Anosov representations with specific properties are Hitchin representations.