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

Trend · papers per month

1122 · Mar 202019922001200920172026
41 results for Explicability

New framework for fairness in machine learning models using SHAP values and adversarial learning.

problem Fairness of model predictions, especially for unprivileged groups.
method Develops a new fairness definition and a framework using SHAP values and adversarial learning to mitigate bias.
result Models produced are fairer and performant, demonstrating the approach on various datasets.

Enhances machine learning interpretability using category theory.

problem Improving machine learning interpretability and social implementation.
method Develops a categorical framework for structured understanding of supervised learning.
result Introduces the Gauss-Markov Adjunction for clarifying residuals and parameters.

The relations between the infinite dimensional geometry of qRq_R-conformal symmetries at qRq_R\to\infty, Berezin quantization of the Lobachevskii plane and Karasev-Maslov asymptotic quantization are explicated. Some aspects of the ``approximate'' representation theory are discussed.

1997-02-02abs ↗pdf ↗

A generalized flag manifold is a homogeneous space of the form G/KG/K, where KK is the centralizer of a torus in a compact connected semisimple Lie group GG. We classify all flag manifolds with four isotropy summands and we study their geometry. We present new GG-invariant Einstein metrics by solving explicity the Ei…

2009-04-10abs ↗pdf ↗

Recently, Honda, Kazez and Matic described an adapted partial open book of a compact contact 3-manifold with convex boundary by generalizing the work of Giroux in the closed case. They also implicitly established a one-to-one correspondence between isomorphism classes of partial open book decompositions modulo positive…

2008-02-06abs ↗pdf ↗

We explicate a number of notions of algebraic laminations existing in the literature, particularly in the context of an exact sequence 1HGQ11\to H\to G \to Q \to 1 of hyperbolic groups. These laminations arise in different contexts: existence of Cannon-Thurston maps; closed geodesics exiting ends of manifolds; dual to …

2015-06-26abs ↗pdf ↗

The purpose of this note is introduce a new axiom (called the Descent Axiom) in the theory of rr-spin cohomological field theories. This axiom explains the origin of gravitational descendants in this theory. Furthermore, the Descent Axiom immediately implies the Vanishing Axiom, explicating the latter (which has no a …

2000-09-06abs ↗pdf ↗

A new test of a wide class of interest rate models is proposed and applied to a recently developed quantum field theoretic model and the industry standard Heath-Jarrow-Morton model. This test is independent of the volatility function unlike other tests previously proposed in the literature. It is found that the HJM mod…

2001-06-16abs ↗pdf ↗

This work aims to reduce inexplicable errors in deep neural networks by obtaining class-level semantics and penalizing misclassifications.

problem Deep neural networks misclassify images, leading to inexplicable errors that can harm trust and societal impact.
method Obtain class-level semantics, propose Weighted Loss Functions (WLFs), and train classifiers with these methods.
result Trained networks have more explicable failure modes and comparable accuracy to existing methods.

The problem of adversarial examples has highlighted the need for a theory of regularisation that is general enough to apply to exotic function classes, such as universal approximators. In response, we give a very general equality result regarding the relationship between distributional robustness and regularisation, as…

2020-02-11abs ↗pdf ↗

We show that the universal odd Chern form, defined on the stable unitary group UU, extends to the loop group LULU in a way that is closed with respect to an equivariant-type differential. This provides an odd analogue to the Bismut-Chern form. We also describe the associated transgression form, the so-called Bismut-Ch…

2013-11-25abs ↗pdf ↗

The study reveals a persistent bias in the distribution of holonomy on compact hyperbolic 3-manifolds.

problem The distribution of holonomy on compact hyperbolic 3-manifolds is not uniformly distributed.
method An asymptotic count of closed geodesics by their length and holonomy, and analysis of spectral parameters.
result A normalized, smoothed bias count of holonomy is distributed according to a probability distribution, controlled by the number of zero spectral parameters.

New approach to nonuniform learnability using measure theory.

problem Nonuniform learnability of hypotheses with varying sample sizes.
method Measure theoretic approach to redefine nonuniform learnability, introducing a new algorithm (Generalize Measure Learnability).
result Achieved statistical consistency in learning countable hypothesis classes.

This paper explores geometric and analytic aspects of Lojasiewicz inequalities on vector bundles.

problem Understanding growth and stability conditions for real-analytic functions over vector bundles.
method Outline theory of functionals and variational problems over vector bundles, explore applications to real-analytic functionals.
result Describes the energy functional on $S^{n-1$ as a functional over a vector bundle.

Paper proposes a modified fairness constraint to address shortcomings of counterfactual fairness.

problem Counterfactual fairness is not a necessary condition for algorithmic fairness.
method Analyzed hypothetical scenario and explicated discrimination to develop causal relevance fairness.
result Causal relevance fairness is a modified constraint that circumvents shortcomings of counterfactual fairness.

For semi-supervised techniques to be applied safely in practice we at least want methods to outperform their supervised counterparts. We study this question for classification using the well-known quadratic surrogate loss function. Using a projection of the supervised estimate onto a set of constraints imposed by the u…

2016-02-25abs ↗pdf ↗

New method uses dendrograms for better mixture model selection and clustering.

problem Selecting the correct number of components in finite mixture models.
method Hierarchical clustering tree derived from overfitted latent mixing measures.
result Consistently selects the true number of mixing components and optimal convergence rate for parameter estimation.

Study on identifying most preferred policy in bandits with vector-valued rewards.

problem Identifying the most preferred policy in bandits with vector-valued rewards.
method Derive a novel lower bound on sample complexity, design the Preference-based Track and Stop (PreTS) algorithm, and derive a new concentration inequality.
result The sample complexity of PreTS is asymptotically tight.

New framework improves interpretability of trainable prompts.

problem Improving task-specific LLM performance with soft prompts remains a black-box method.
method Developed a theoretical framework for evaluating interpretability of trainable prompts, inspired new objective functions.
result Found a fundamental trade-off between interpretability and task performance in trainable prompts.

Though used extensively, the concept and process of machine learning (ML) personalization have generally received little attention from academics, practitioners, and the general public. We describe the ML approach as relying on the metaphor of the person as a feature vector and contrast this with humanistic views of th…

2019-12-17abs ↗pdf ↗

New model forecasts power consumption with high accuracy over months to years.

problem Probabilistic forecasting of power consumption in a middle-term horizon.
method Combines traditional time-series analysis with weather conditions using Gaussian Process.
result Promising results in Out-of-Sample density forecasts up to one year.

Continuous control imitation learning fails if expert actions are smooth.

problem Continuous control imitation learning fails if expert actions are smooth.
method Study of imitation learning in discrete-time, continuous state-and-action control systems.
result Any smooth, deterministic imitator policy suffers exponentially larger error than the expert.

This paper argues for decolonizing AI alignment by incorporating open-source Hinduism concepts.

problem Coloniality in AI development and deployment, particularly in alignment practices.
method Proposes three forms of openness: model, societal, and excluded knowledge openness, using Hindu viśe\d{s}a-dharma.
result AI alignment should be decolonialized to avoid moral absolutism and better align with desired values.

The paper argues for interpreting neural networks as approximating the true posterior, enhancing in-context learning.

problem The limitations of traditional MLE interpretation in large-scale, single-epoch training setups.
method Demonstrates the power of interpreting neural networks as approximations of the true posterior, using experiments to predict generalizations.
result Models become robust in-context learners by effectively composing knowledge from their training data, revealing surprising generalizations.

Paper explains learning property of logistic and softmax losses for balanced and imbalanced class data.

problem Understanding and optimizing loss functions for deep neural networks with class imbalances.
method Analyzing necessary conditions for convergence of logistic and softmax losses in CNNs.
result Proposes a novel reweighted logistic loss function that improves performance over softmax loss.

STNN-DDI predicts drug interactions using substructure-aware neural networks.

problem Predicting drug-drug interactions (DDIs) to avoid side effects in poly-drug treatments.
method Designing a novel Substructure-ware Tensor Neural Network (STNN-DDI) that learns a 3-D tensor of substructure-substructure interactions.
result Significant improvement in AUC, AUPR, Accuracy, and Precision compared to state-of-the-art models.

Dynamical systems are widely used in science and engineering to model systems consisting of several interacting components. Often, they can be given a causal interpretation in the sense that they not only model the evolution of the states of the system's components over time, but also describe how their evolution is af…

2018-03-23abs ↗pdf ↗