RYU framework constructs safe regions for optimization problems.
problem Optimization problems with specific component functions.
method RYU framework for constructing safe regions.
result RYU framework improves upon state-of-the-art methods.
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
48 results for “RYU framework”
New framework constructs holographic tensor networks using hyperbolic buildings.
problem Building holographic tensor networks for non-integer dimensions and fractal spaces.
method Introducing a unifying framework based on hyperbolic buildings and dualities.
result Constructs a family of bulk regions satisfying complementary recovery and Ryu-Takayanagi formula.
Adachi and Ryu introduced a category Prob of probability spaces whose objects are all probability spaces and whose arrows correspond to measurable functions satisfying an absolutely continuous requirement in [Adachi and Ryu, 2019]. In this paper, we develop a binomial asset pricing model based on Prob. We introduce gen…
We generalize the notion of monetary value measures developed with category theory in [Adachi, 2014] by extending their base category from the category \c{hi} to the category of probability spaces Prob introduced in [Adachi and Ryu, 2016].
Study uses holography to analyze entanglement entropy in deformed CFTs.
problem Analyzing entanglement entropy in $Tar{T}$-deformed CFTs.
method Holographic methods and direct bulk gravitational action evaluation.
result Agreement with known results for entanglement entropy.
Develops a new filtration for asset pricing models.
problem Models of financial asset pricing need to account for information loss.
method Introduces a generalized filtration to represent information loss.
result Validates the new filtration in a binomial asset pricing model.
Bit threads provide an alternative description of holographic entanglement, replacing the Ryu-Takayanagi minimal surface with bulk curves connecting pairs of boundary points. We use bit threads to prove the monogamy of mutual information (MMI) property of holographic entanglement entropies. This is accomplished using t…
A recent proposal by Ryu and Takayanagi for a holographic interpretation of entanglement entropy in conformal field theories dual to supergravity on anti-de Sitter (adS) is generalized to include entanglement entropy of black holes living on the boundary of adS. The generalized proposal is verified in boundary dimensio…
The Ryu-Takayanagi conjecture connects the entanglement entropy in the boundary CFT to the area of open co-dimension two minimal surfaces in the bulk. Especially in AdS(4), the latter are two-dimensional surfaces, and, thus, solutions of a Euclidean non-linear sigma model on a symmetric target space that can be reduced…
When a spacetime has boundaries, the entangling surface does not have to be necessarily compact and it may have boundaries as well. Then there appear a new, boundary, contribution to the entanglement entropy due to the intersection of the entangling surface with the boundary of the spacetime. We study the boundary cont…
Study on bit threads and their locking properties in holographic spacetimes.
problem Understanding the conditions under which regions can be locked in holographic spacetimes.
method Investigation of different density bounds and their implications on the locking of regions.
result Non-crossing regions can be locked under the most stringent bound, but crossing regions cannot.
The Ryu-Takayanagi (RT) formula relates the entanglement entropy of a region in a holographic theory to the area of a corresponding bulk minimal surface. Using the max flow-min cut principle, a theorem from network theory, we rewrite the RT formula in a way that does not make reference to the minimal surface. Instead, …
New formula connects holographic entanglement entropy to Willmore energy in 5D.
problem Analogous to 3D, find a new formula for 5D entanglement entropy.
method Prove equivalence between holographic entanglement entropy and Willmore energy in 5D.
result The Willmore energy in 5D is not globally minimized by a round ball.
Introduces AMLB, an open benchmark for AutoML frameworks.
problem Challenges in comparing AutoML frameworks.
method Open benchmark with 9 AutoML frameworks, 71 classification, 33 regression tasks, multi-faceted analysis, Bradley-Terry trees.
result Differences in AutoML frameworks' performance and trade-offs.
EagerPy simplifies writing code for multiple deep learning frameworks.
problem Code duplication and framework lock-in when using different deep learning libraries.
method Integrates multiple frameworks into a single Python framework.
result Automatic compatibility across PyTorch, TensorFlow, JAX, and NumPy.
OBSER framework infers sub-environments from objects, outperforming scene-based methods.
problem Zero-shot recognition of environments from object distributions.
method Bayesian framework using metric and self-supervised learning models to estimate object distributions in latent space.
result OBSER framework reliably performs inference in open-world and photorealistic environments, outperforming scene-based methods.
We propose a unified framework to speed up the existing stochastic matrix factorization (SMF) algorithms via variance reduction. Our framework is general and it subsumes several well-known SMF formulations in the literature. We perform a non-asymptotic convergence analysis of our framework and derive computational and …
Extends DeTEcT framework for token economies with dynamic and probabilistic parameters.
problem Modeling wealth distribution in token economies with dynamic and probabilistic parameters.
method Introduces four parametrization techniques: dynamic vs static, probabilistic vs non-probabilistic.
result Derives existing wealth distribution models from DeTEcT framework with added restrictions.
Delay embedding---a method for reconstructing dynamical systems by delay coordinates---is widely used to forecast nonlinear time series as a model-free approach. When multivariate time series are observed, several existing frameworks can be applied to yield a single forecast combining multiple forecasts derived from va…
New framework assesses and benchmarks ML methods for multivariate time series.
problem Benchmarking and explaining performance of machine learning methods.
method Proposes a new framework with systematized performance-explainability characteristics.
result Illustrates application to multivariate time series classifiers.
A modular framework for knowledge distillation simplifies experiments and reproducibility.
problem Difficulty in reproducing knowledge distillation studies due to lack of generalized frameworks.
method A configuration-driven PyTorch framework for knowledge distillation studies.
result Demonstrates efficient training strategies and various knowledge distillation methods.
We give a combinatorial characterization of generic minimally rigid reflection frameworks. The main new idea is to study a pair of direction networks on the same graph such that one admits faithful realizations and the other has only collapsed realizations. In terms of infinitesimal rigidity, realizations of the former…
The paper analyzes frameworks for integrating sustainability into investment decisions.
problem Understanding how ESG factors influence investment choices.
method Examined and analyzed various theoretical frameworks including Behavioral Finance, Modern Portfolio, and Risk Management.
result Investors increasingly integrate ESG factors to optimize financial outcomes and societal goals.
We explore a framework called boosted Markov networks to combine the learning capacity of boosting and the rich modeling semantics of Markov networks and applying the framework for video-based activity recognition. Importantly, we extend the framework to incorporate hidden variables. We show how the framework can be ap…
In this paper we introduce a flexible HJM-type framework that allows for consistent modelling of intraday, spot, futures, and option prices. This framework is based on stochastic processes with economic interpretations and consistent with the initial term structure given in the form of a price forward curve. Furthermor…
We present generalization bounds for the TS-MKL framework for two stage multiple kernel learning. We also present bounds for sparse kernel learning formulations within the TS-MKL framework.
PySAD offers a unified Python framework for efficient streaming anomaly detection.
problem Efficient anomaly detection in streaming data with strict constraints.
method Unified architecture with 17+ streaming algorithms, specialized components, and support for multiple learning paradigms.
result PySAD enables real-time processing with bounded memory and is compatible with other Python frameworks.
With the inflation of the data, clustering analysis, as a branch of unsupervised learning, lacks unified understanding and application of its mathematical law. Based on the view of fixed point, this paper restates the model-based clustering and proposes a unified clustering framework. In order to find fixed points as c…
DIVA clusters dynamic data without needing cluster count, outperforming baselines.
problem Clustering complex, dynamic data without prior knowledge of cluster count.
method Nonparametric Dirichlet Process Mixtures with memoized online variational inference.
result DIVA outperforms state-of-the-art in classifying complex data with changing features.
This paper introduces a new scalable multi-objective deep reinforcement learning (MODRL) framework based on deep Q-networks. We develop a high-performance MODRL framework that supports both single-policy and multi-policy strategies, as well as both linear and non-linear approaches to action selection. The experimental …
Unified framework for analyzing machine learning model attributions.
problem Lack of a general and theoretical framework for understanding attribution methods.
method Proposes a Taylor attribution framework to unify and analyze seven mainstream attribution methods.
result Established three principles for good attribution and empirically validated the Taylor reformulations.
Unified framework for Bayesian online learning in changing conditions.
problem Probabilistic online learning in non-stationary environments.
method BONE framework with three modelling choices and two algorithmic choices.
result Framework allows for reinterpreting and proposing new methods.
We present a probabilistic framework for nonlinearities, based on doubly truncated Gaussian distributions. By setting the truncation points appropriately, we are able to generate various types of nonlinearities within a unified framework, including sigmoid, tanh and ReLU, the most commonly used nonlinearities in neural…
ProbDR framework interprets DR algorithms as probabilistic inference.
problem Efficiently compressing high-dimensional data into lower dimensions.
method ProbDR variational framework that treats DR as probabilistic inference.
result ProbDR unifies various DR algorithms and enables probabilistic reasoning.
The new framework for finance is proposed. This framework based on three known approaches in econophysics. Assumptions of the framework are the following: 1. For the majority of situations market follows non-arbitrage condition. 2. For the small number of situations market influenced by the actions of big firms. 3. If …
Framework solves bilevel optimization on manifolds.
problem Solving bilevel optimization problems with manifold constraints.
method Hypergradient estimation strategies on manifolds, convergence and complexity analyses.
result Efficacy demonstrated through various applications.
We study the tracking problem, namely, estimating the hidden state of an object over time, from unreliable and noisy measurements. The standard framework for the tracking problem is the generative framework, which is the basis of solutions such as the Bayesian algorithm and its approximation, the particle filters. Howe…
We extend our generic rigidity theory for periodic frameworks in the plane to frameworks with a broader class of crystallographic symmetry. Along the way we introduce a new class of combinatorial matroids and associated linear representation results that may be interesting in their own right. The same techniques immedi…
A game-theoretic framework identifies influential hyperparameters for neural networks.
problem Understanding which hyperparameters are most important for neural network performance.
method Employing Shapley Effects for global sensitivity analysis and Pareto front sets for identifying effective configurations.
result Reveals which hyperparameters are most influential for different objectives in neural networks.
Graph-based methods provide a powerful tool set for many non-parametric frameworks in Machine Learning. In general, the memory and computational complexity of these methods is quadratic in the number of examples in the data which makes them quickly infeasible for moderate to large scale datasets. A significant effort t…
Discount Modelsq-fin.MF
Proposes a new framework for discount models.
problem Arbitrage-free dynamic framework for discount models.
method Derives general consistency conditions for factor models.
result Alternative to Heath--Jarrow--Morton framework for forward rates.
Joint Embedding Learning and Low-Rank Approximation: A Framework for Incomplete Multi-view Learningcs.LG
In real-world applications, not all instances in multi-view data are fully represented. To deal with incomplete data, Incomplete Multi-view Learning (IML) rises. In this paper, we propose the Joint Embedding Learning and Low-Rank Approximation (JELLA) framework for IML. The JELLA framework approximates the incomplete d…
This paper proposes a novel framework for fusing multi-temporal, multispectral satellite images and OpenStreetMap (OSM) data for the classification of local climate zones (LCZs). Feature stacking is the most commonly-used method of data fusion but does not consider the heterogeneity of multimodal optical images and OSM…
This study develops an online predictive optimization framework for dynamically operating a transit service in an area of crowd movements. The proposed framework integrates demand prediction and supply optimization to periodically redesign the service routes based on recently observed demand. To predict demand for the …
Unified statistical framework for LSTM model selection.
problem Model selection and hyperparameter tuning in LSTM networks is heuristic and computationally expensive.
method Proposes a statistical framework extending classical model selection ideas to LSTM networks.
result Improved performance of the proposed framework demonstrated on biomedical data.
CFFL framework improves fairness in FL without sacrificing accuracy.
problem Overfitting and lack of collaborative fairness in Federated Learning.
method CFFL framework uses reputation to ensure participants converge to different models.
result CFFL achieves high fairness, comparable accuracy, and better performance than Standalone and Distributed frameworks.
TorchGAN is a PyTorch based framework for writing succinct and comprehensible code for training and evaluation of Generative Adversarial Networks. The framework's modular design allows effortless customization of the model architecture, loss functions, training paradigms, and evaluation metrics. The key features of Tor…
Proposes a Taylor framework to unify and analyze attribution methods.
problem Lack of a unified guideline for feature contribution assignment in machine learning models.
method Introduces a Taylor attribution framework to model the attribution problem and reformulates fourteen mainstream methods.
result Empirically validates the Taylor reformulations and reveals a positive correlation between performance and principles followed.