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

Trend · papers per month

57114170227 · Jun 202619922001200920172026
48 results for two-level manifolds

This work analyzes generalization in federated learning using information theory.

problem Generalization performance in federated learning is less explored compared to centralized learning.
method The work applies an information-theoretic analysis via the conditional mutual information (CMI) framework to study federated learning's two-level generalization.
result The work derives multiple CMI-based bounds, including hypothesis-based CMI bounds and fast-rate evaluated CMI bounds, which improve convergence rates for specific model aggregation strategies and structured loss functions.

As a contribution to interpretable machine learning research, we develop a novel optimization framework for learning accurate and sparse two-level Boolean rules. We consider rules in both conjunctive normal form (AND-of-ORs) and disjunctive normal form (OR-of-ANDs). A principled objective function is proposed to trade …

2016-06-18abs ↗pdf ↗

Develops a two-level monotonic multistage recommender system for better user-specific prediction.

problem Leveraging user-item-stage dependencies in a monotonic chain of events for enhanced prediction accuracy.
method A multistage recommender system with a two-level monotonic property, using a large-margin classifier based on a nonnegative additive latent factor model.
result The proposed method outperforms existing methods in simulations and an article sharing dataset.

This work improves interpretability in deep learning models by introducing a two-level concept discovery framework.

problem High complexity and lack of interpretability in deep learning models, especially for safety-critical tasks.
method Concept Bottleneck Models (CBMs) framework combining vision-language models and data-driven coarse-to-fine concept selection.
result The proposed framework outperforms recent CBM approaches and provides a principled interpretability.

LARF improves random forests with attention mechanisms and contamination models.

problem Improving accuracy in classification tasks with random forests.
method Introduces a two-level attention mechanism and uses a mixture of contamination models.
result Significantly improved classification performance on various datasets.

Paper develops efficient algorithms for robust optimization across multiple groups.

problem Minimizing maximal empirical risk across distinct groups in robust optimization.
method Develops ALEG and ALEM algorithms for two-level finite-sum convex-concave minimax optimization.
result Achieves ε-accuracy with complexity O(m√(nlnm/ε)) and outperforms state-of-the-art methods.

OKDDip uses diverse peers to improve online knowledge distillation.

problem Early saturation in group-based distillation.
method Two-level distillation with multiple auxiliary peers and a group leader, using attention-based aggregation weights.
result OKDDip consistently gives better performance than state-of-the-art approaches.

We propose to learn a hierarchical prior in the context of variational autoencoders to avoid the over-regularisation resulting from a standard normal prior distribution. To incentivise an informative latent representation of the data, we formulate the learning problem as a constrained optimisation problem by extending …

2019-05-13abs ↗pdf ↗

This paper examines the valuation of American capped call options with two-level caps. The structure of the immediate exercise region is significantly more complex than in the classical case with constant cap. When the cap grows over time, making extensive use of probabilistic arguments and local time, we show that the…

2017-07-19abs ↗pdf ↗

Playing repeated matrix games (RMG) while maximizing the cumulative returns is a basic method to evaluate multi-agent learning (MAL) algorithms. Previous work has shown that UCBUCB, M3M3, SS or Exp3Exp3 algorithms have good behaviours on average in RMG. Besides, hedging algorithms have been shown to be effective on predi…

2018-10-15abs ↗pdf ↗

We study the quantum synchronization between a pair of two-level systems inside two coupled cavities. By using a digital-analog decomposition of the master equation that rules the system dynamics, we show that this approach leads to quantum synchronization between both two-level systems. Moreover, we can identify in th…

2017-09-25abs ↗pdf ↗

A new method predicts stock ranking uncertainty to improve trading performance during regime shifts.

problem Ranking models fail during regime shifts, leading to suboptimal performance.
method Adapting DEUP to rankers, predicting rank displacement and uncertainty, and proposing a two-level deployment policy.
result The two-level deployment policy improves risk-adjusted performance and indicates DEUP adds value mainly as a tail-risk guard.

The stochastic variational inference (SVI) paradigm, which combines variational inference, natural gradients, and stochastic updates, was recently proposed for large-scale data analysis in conjugate Bayesian models and demonstrated to be effective in several problems. This paper studies a family of Bayesian latent vari…

2016-12-12abs ↗pdf ↗

A2SGD reduces distributed SGD communication to O(1) per worker.

problem Heavy communication costs in distributed SGD for large models.
method Two-level gradient averaging to consolidate gradients to two local averages.
result Achieves O(1) communication complexity per worker, significantly reducing traffic and training time.

The paper designs neural networks with assurance for controlling nonlinear systems.

problem Designing neural networks with assurance for nonlinear system control.
method Bounding the number of affine functions needed for a CPWA function, connecting it to a TLL NN architecture.
result The TLL NN architecture is parameterized by the number of affine functions in the CPWA function it realizes.

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.

Polynomial-time reachability for LTI systems with TLL NN controllers is achieved.

problem Bounding the reachable set of LTI systems controlled by TLL NN controllers.
method Polynomial-time computation of exact one-step reachable set and tight bounding box via two methods.
result Exact reachability computation in polynomial time for TLL NN controllers.

MCCE generates realistic counterfactual explanations for tabular data.

problem Creating valid and actionable counterfactual explanations for complex tabular data.
method MCCE models the joint distribution of features and decision using an autoregressive generative model with decision trees. It samples counterfactuals and removes invalid ones.
result MCCE outperforms state-of-the-art methods on various performance metrics and is faster.

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.

GraphHull models networks with clear multi-scale explanations of community structure.

problem Lack of self-explainable models in graph machine learning.
method Two-level convex hulls with global archetypes and local prototypes.
result GraphHull models networks with clear multi-scale explanations.

HyperSAGE learns node representations in hypergraphs without losing information.

problem Learning node representations in hypergraphs is complex due to higher-order relations.
method Two-level neural message passing strategy for accurate information propagation.
result HyperSAGE outperforms state-of-the-art methods on benchmark datasets.

New method controls linear systems with partial info and disturbances.

problem Controlling linear dynamical systems under partial observation and adversarial disturbances.
method Double Spectral Control (DSC) using two-level spectral approximation strategy.
result Matches best known regret guarantees with exponential runtime improvement.

Proposes GST for efficient computation of generalized Sobolev transport on graph metrics.

problem Optimal transport for measures on graph metric spaces with limited flexibility.
method Introduces GST, a generalized variant of Sobolev transport that adapts to various geometric structures.
result GST is significantly faster than Orlicz-Wasserstein (OW) and demonstrates advantages in document classification and topological data analysis.

Most research on the interpretability of machine learning systems focuses on the development of a more rigorous notion of interpretability. I suggest that a better understanding of the deficiencies of the intuitive notion of interpretability is needed as well. I show that visualization enables but also impedes intuitiv…

2017-11-20abs ↗pdf ↗

We study the isoperimetric, functional and concentration properties of nn-dimensional weighted Riemannian manifolds satisfying the Curvature-Dimension condition, when the generalized dimension NN is negative, and more generally, is in the range N(,1)N \in (-\infty,1), extending the scope from the traditional range $N \i…

2014-09-14abs ↗pdf ↗

This work analyzes Gibbs samplers for Bayesian hierarchical models without dimensionality constraints.

problem Analyzing convergence properties of Gibbs samplers for Bayesian hierarchical models.
method Using Bayesian asymptotics and total variation mixing times, the study provides dimension-free convergence results.
result Dimension-free convergence results for Gibbs samplers targeting hierarchical models under random data-generating assumptions.

The quantum navigation problem of finding the time-optimal control Hamiltonian that transports a given initial state to a target state through quantum wind, that is, under the influence of external fields or potentials, is analysed. By lifting the problem from the state space to the space of unitary gates realising the…

2014-10-24abs ↗pdf ↗

Anomaly detection is the process of finding data points that deviate from a baseline. In a real-life setting, anomalies are usually unknown or extremely rare. Moreover, the detection must be accomplished in a timely manner or the risk of corrupting the system might grow exponentially. In this work, we propose a two lev…

2019-04-24abs ↗pdf ↗

The study predicts bankruptcy in Indian companies using financial ratios.

problem Predicting early signs of corporate bankruptcy in Indian companies.
method Logistic regression considering profitability, leverage, and efficiency ratios for one and two years before bankruptcy.
result The model accurately predicts bankruptcy with 81.4% and 85.1% accuracy one and two years before filing, respectively.

This paper is the continuation of "Pricing with coherent risk" and deals with further applications of coherent risk measures to problems of finance. First, we study the optimization problem. Three forms of this problem are considered. Furthermore, the results obtained are applied to the optimality pricing. Again three …

2006-05-02abs ↗pdf ↗

In this study, we investigate the use of global information to speed up the learning process and increase the cumulative rewards of reinforcement learning (RL) in competition tasks. Within the actor-critic RL, we introduce multiple cooperative critics from two levels of the hierarchy and propose a reinforcement learnin…

2019-02-08abs ↗pdf ↗