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

53105158210 · May 202619922001200920172026
48 results for levelled

Characterizes graphs with leveled embeddings and introduces new graph invariants.

problem Understanding the properties of leveled embeddings in spatial graphs.
method Characterization of graphs with leveled embeddings, introduction of new invariants.
result Characterization of graphs with low level number and determination of specific invariants for complete graphs and complete bipartite graphs.

This paper analyzes user-level local differential privacy in distributed systems.

problem The relationship between user-level and item-level local differential privacy under the local model is complex.
method The paper analyzes the mean estimation problem and applies it to stochastic optimization, classification, and regression. It proposes adaptive strategies to achieve optimal performance at all privacy levels.
result The proposed methods are minimax optimal up to logarithmic factors and show that user-level DP can lead to faster convergence rates than item-level DP.

Music FaderNets learns high-level musical qualities from low-level attributes.

problem Learning high-level musical qualities from limited data and subjective labels.
method Model low-level attributes through feature disentanglement and latent regularization; infer high-level features from low-level representations using GM-VAEs.
result Model successfully learns intrinsic relationships between high-level features and low-level attributes with minimal labeled data.

The paper discovers and evaluates support and resistance levels in financial time series.

problem Understanding and predicting support and resistance levels in financial markets.
method Developed a heuristic discovery algorithm to identify SR levels in intraday price series.
result Discovered SR levels statistically significantly reverse price trends and have a decay aspect over time.

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.

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 ↗

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.

FRESH combines patient-level and aggregate-level data for better clinical decision making.

problem Combining patient-level and aggregate-level data for clinical decision making.
method FRESH method that re-calibrates a patient-level model to match specified aggregate statistics.
result Unified data-efficient model for clinical decision making.

This paper improves level generation using VAEs for coherent, logically following segments.

problem Generating coherent levels of non-fixed length and blending levels from different games.
method Sequential segment-based level generation using VAEs with a classifier for logical placement.
result Generated levels are more coherent and capable of blending levels from different games.

\textit{Multiple Instance Learning} (MIL) is concerned with learning from bags of instances, where only bag labels are given and instance labels are unknown. Existent approaches in this field were mainly designed for the bag-level label prediction (predict labels for bags) but not the instance-level (predict labels for…

2019-05-29abs ↗pdf ↗

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.

The paper calculates dimensions of higher Landau levels on compact manifolds.

problem Understanding Landau levels on compact manifolds in the large magnetic field limit.
method Computing dimensions as Riemann-Roch numbers, studying Toeplitz algebras, and proving isomorphisms.
result Each Landau level is isomorphic to a quantization twisted by an auxiliary bundle.

Study compares hypergraph and graph-level models for higher-order relational learning.

problem Evaluating effectiveness of hypergraph-level vs. graph-level models in relational learning.
method Systematic evaluation of various hypergraph and graph-level architectures.
result Graph-level models applied to hypergraph expansions outperform hypergraph-level models.

For leveled spatial graphs, we find a surface embedding that allows cellular embedding.

problem Finding a surface embedding for general spatial graphs is not always possible.
method Define leveled property, decompose graph into subgraphs, and construct surface.
result For leveled spatial graphs with a small number of levels, a surface can always be found.

Researchers infer firm-level supply chain networks from sector-level data to assess systemic risk.

problem Estimating systemic risk in economic systems using firm-level data.
method Maximum-entropy algorithms applied to input-output tables and firm-level aggregate output data.
result The most realistic systemic risk content is retrieved by models incorporating disaggregated firm-specific inputs by sector.

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.

Develops a method to ensure accurate quantile forecasts across multiple levels.

problem Ensuring accurate quantile forecasts at multiple levels, even under distribution shifts.
method Multi-level quantile tracker (MultiQT) wraps around any forecaster to produce calibrated forecasts.
result Guaranteed calibration of quantile forecasts at multiple levels, even against adversarial shifts.

Trajectory-level supervision allows efficient offline reinforcement learning.

problem Offline reinforcement learning
method Developing a statistical theory for offline policy optimization from trajectory-level labels
result Proving a high-probability guarantee of order O~(H2Csa(π)/n)\widetilde O(H^2\sqrt{C_{sa}(\pi^\star)/n})

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 knot KK in genus-11 11-bridge position can be moved by isotopy to lie in a union of nn parallel tori tubed by n1n-1 tubes so that KK intersects each tube in two spanning arcs, which we call a leveling of the position. The minimal nn for which this is possible is an invariant of the position, called the level …

2018-12-30abs ↗pdf ↗

Study shows how SL2\operatorname{SL}_2 Hitchin connection at level four behaves.

problem Understanding the behavior of SL2\operatorname{SL}_2 Hitchin connection at level four.
method Using Mumford-Welters connections and equivariant conformal embeddings, the connection's monodromy is shown to be finite.
result The monodromy of the SL2\operatorname{SL}_2 Hitchin connection at level four is finite.

Quantum representations of mapping class groups are locally rigid at prime levels.

problem Locally rigid properties of quantum representations of mapping class groups.
method Proving local rigidity for Fibonacci representations of mapping class groups at prime levels.
result Local rigidity of Fibonacci representations of mapping class groups at prime levels.

Novel method for bilevel optimization with convex lower-level problem.

problem Minimizing a smooth objective over the optimal solution set of a convex constrained problem.
method Local cutting plane approximation of lower-level solution set combined with conditional gradient updates.
result Achieves optimal iteration complexity for the considered class of bilevel problems.

New algorithm optimizes adaptive return level for Markowitz portfolios.

problem Finding an optimal return level for Markowitz portfolios when investor's risk appetite is unknown.
method Krasnoselskii-Mann Proximity Algorithm based on proximity operator and momentum technique.
result Significant improvements over state-of-the-art methods in portfolio optimization.

RocketStack integrates predictions from multiple base learners using a recursive stacking architecture up to ten levels.

problem Feature redundancy, complexity, and computational burden in deep stacking.
method Level-aware recursive stacking with pruning and compression techniques.
result Increasing accuracy with depth and outperforming standalone ensembles at later levels.

Forecasts of multivariate probability distributions are required for a variety of applications. Scoring rules enable the evaluation of forecast accuracy, and comparison between forecasting methods. We propose a theoretical framework for scoring rules for multivariate distributions, which encompasses the existing quadra…

2020-02-21abs ↗pdf ↗

We study Veech groups of covering surfaces of primitive translation surfaces. Therefore we define congruence subgroups in Veech groups of primitive translation surfaces using their action on the homology with entries in Z/aZ\mathbb{Z}/a\mathbb{Z}. We introduce a congruence level definition and a property of a primitive t…

2014-03-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 ↗

Study on transnormal functions and their level sets on Finsler manifolds.

problem Understanding transnormal functions and their geometric properties on Finsler manifolds.
method Proving smoothness of focal varieties and regular level sets of transnormal functions.
result Focal varieties of a C2 transnormal function are smooth submanifolds and regular level sets are tubes over these varieties.

As mobile devices become more and more popular, mobile gaming has emerged as a promising market with billion-dollar revenues. A variety of mobile game platforms and services have been developed around the world. A critical challenge for these platforms and services is to understand the churn behavior in mobile games, w…

2019-01-14abs ↗pdf ↗

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.