Undirected graphs can be used to describe matrix variate distributions. In this paper, we develop new methods for estimating the graphical structures and underlying parameters, namely, the row and column covariance and inverse covariance matrices from the matrix variate data. Under sparsity conditions, we show that one…
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.
169,051 papers · 148 categories
Trend · papers per month
48 results for “Matrix Replication”
Model predicts market dynamics of competing technologies.
problem Understanding market dynamics and technology competition.
method Modified Replicator Dynamics model with external influences.
result Shows how external influences affect market outcomes.
Analog arrays speed up ConvNets by parallelizing kernel matrix training.
problem Early ConvNets struggle with analog arrays due to small kernel matrices.
method Replicate kernel matrix on multiple analog arrays, training in parallel.
result Analog arrays achieve high acceleration factors (16-128) for ConvNets.
New algorithm ensures consistent results in constrained MAB problems.
problem Achieving consistent results in constrained MAB problems.
method Developed replicable algorithms for constrained MAB problems using the optimism principle.
result Regret and constraint violation of replicable algorithms match those of non-replicable ones.
Unified framework for fixed-income pricing and liability replication.
problem Static arbitrage and discount curve construction.
method Model-free framework for static fixed-income pricing and liability replication.
result Existence of strictly positive discount curves reproducing market prices and least-cost super-replicating portfolios.
Characterizes super-replication prices in a financial market model.
problem Characterizing prices in a financial market model.
method Characterizes prices as the supremum of mono-prior super-replication prices through extreme priors and martingale measures.
result Super-replication prices are the supremum of mono-prior super-replication prices.
New study on replicability and stability in machine learning algorithms.
problem Ensuring consistent results in machine learning models without fixing randomness.
method Introduced global stability and list replicability concepts, proving their equivalence and boosting list replicability.
result Global stability can only be achieved weakly, while list replicability can be boosted to achieve high probability of consistent results.
Study on computational aspects of replicable learning, bridging statistical and algorithmic perspectives.
problem Understanding the computational connections between replicability and various learning paradigms.
method Design of replicable learners, lifting framework, and transformation techniques.
result Efficient replicable learners for specific learning problems under various distributions.
Self-replicating 3-manifoldsmath.GT
The paper classifies self-replicating 3D shapes using algebraic models.
problem Understanding self-replicating 3D shapes.
method Using idempotents in the (2+1)-cobordism category to classify 3-manifolds.
result A classification theorem for self-replicating 3-manifolds.
We consider the pricing of European-style structured credit payoff in a static framework, where the underlying default times are independent given a common factor. A practical application would consist of the pricing of nth-to-default baskets under the Gaussian copula model (GCM). We provide necessary and sufficient co…
New algorithm prevents strategic replication in multi-armed bandit problems.
problem Strategic replication by agents can exploit bandit algorithms' balance.
method Designs Hierarchical UCB (H-UCB) and Robust Hierarchical UCB (RH-UCB) algorithms.
result Achieves -regret and sublinear regret in realistic scenarios.
Extends super-replication theorem with dynamic strategies and transaction costs.
problem Dynamic super-replication under proportional transaction costs.
method Generalizes admissible strategies and defines a well-defined super-replication price process.
result Well-defined super-replication price process in dynamic setting.
Study reveals statistical bias in dataset replication, reducing accuracy drop from 11-14% to 3.6%.
problem Statistical bias in dataset replication affects model generalization accuracy.
method Analyzed ImageNet-v2, identified and corrected for bias, and compared results.
result Correcting bias reduces accuracy drop from 11-14% to 3.6%.
Study replicability in high-dimensional statistics, resolving open problems.
problem Ensuring consistent results in high-dimensional statistical tasks.
method Introduced replicable learning algorithms and established computational and statistical equivalence with high-dimensional isoperimetric tilings.
result Matching sample complexity upper and lower bounds for replicable mean estimation and coin problem.
New uniformity tester ensures consistent results across different samples.
problem Non-replicable behavior of uniformity testing algorithms.
method Develops a replicable uniformity tester with improved sample complexity.
result Achieves nearly linear dependence on replicability factor .
Paper proposes a new method to detect node replication attacks in Vehicular Ad-hoc Networks.
problem Node replication attacks in Vehicular Ad-hoc Networks.
method Adapted statistical methodology for detecting node replication attacks.
result New method outperforms state-of-the-art techniques in detecting node replication attacks.
ERICA assesses replicability of cluster analysis results.
problem Lack of quantitative scrutiny for clustering results.
method ERICA: a framework to assess replicability of cluster analysis.
result Clusters are found to be replicable in synthetic data but not in real-world datasets.
In this work we introduce the notion of fully incomplete markets. We prove that for these markets the super-replication price coincide with the model free super-replication price. Namely, the knowledge of the model does not reduce the super-replication price. We provide two families of fully incomplete models: stochast…
By the classical Martingale Representation Theorem, replication of random vectors can be achieved via stochastic integrals or solutions of stochastic differential equations. We introduce a new approach to replication of random vectors via adapted differentiable processes generated by a controlled ordinary differential …
Despite our extensive knowledge of biophysical properties of neurons, there is no commonly accepted algorithmic theory of neuronal function. Here we explore the hypothesis that single-layer neuronal networks perform online symmetric nonnegative matrix factorization (SNMF) of the similarity matrix of the streamed data. …
We study super--replication of contingent claims in markets with fixed transaction costs. This can be viewed as a stochastic impulse control problem with a terminal state constraint. The first result in this paper reveals that in reasonable continuous time financial market models the super--replication price is prohibi…
New approach optimizes expensive black-box systems with uncertain outputs.
problem Optimizing expensive black-box systems with limited data and uncertainty.
method Flexible non-interpolating surrogate model (TK-MARS) and Smart-Replication approach.
result TK-MARS outperforms original MARS and detects important variables.
Adaptive Replication Strategies in Trust-Region-Based Bayesian Optimization of Stochastic Functionsmath.OC
Adaptive replication improves stochastic function optimization.
problem Challenges in accurately estimating functions with high variance.
method Trust-region-based Bayesian optimization with adaptive replication.
result Adaptive replication substantially improves solution accuracy and efficiency.
Replicable clustering algorithms for k-medians, k-means, and k-centers are proposed.
problem Designing clustering algorithms that produce the same partition on repeated runs under the same distribution.
method Utilizing approximation routines for combinatorial clustering problems in a black-box manner.
result Replicable algorithms for statistical -medians, -means, and -centers with specified approximation and sample complexities.
In this paper we propose a new robust algorithm to find the optimal static replicating portfolios for general nonlinear payoff functions and give the estimate of the rate of convergence that is absent in the literature. We choose the static replication by minimizing the error bound between the nonlinear payoff function…
TF-Replicator simplifies distributed ML for researchers.
problem Complex distributed ML code for researchers.
method Abstraction over TensorFlow, data-parallel and model-parallel.
result Strong scalability without distributed systems expertise.
Optimizes Bayesian priors for matrix factorization without posterior inference.
problem Selecting optimal priors for Bayesian models in machine learning.
method Prior predictive distribution and virtual statistics matching user-provided or observed data statistics.
result Analytically determines hyperparameters for Poisson factorization models.
The paper prices long-term options with a reflecting barrier model.
problem Pricing long-term options with asset price limits.
method Model asset price as geometric Brownian motion with a lower reflecting barrier, pricing options using compound options.
result Option prices can be determined using standard risk-neutral arguments, and hedging strategies are available.
New RL algorithm ensures stable, replicable policies.
problem Stability and replicability issues in RL algorithms.
method Introduced weak and strong forms of list replicability, developed a novel planning strategy, and tested state reachability.
result Proved efficient tabular RL algorithm with polynomial list complexity.
Study on replicability in reinforcement learning algorithms.
problem Ensuring consistent policy outputs in reinforcement learning.
method Mathematical study focusing on replicability in discounted tabular MDPs with a generative model.
result Design of efficient replicable and TV indistinguishable algorithms for policy estimation.
Study insider trading benefits in a market with high transaction costs.
problem Super--replication of European contingent claims in illiquid markets.
method Model insider information and quadratic transaction costs, analyze scaling limits.
result Scaling limit gives the value of insider information.
Replicates and improves Uniswap V3 model using DDQN and Mamba.
problem Improving liquidity provision in Uniswap V3 with reinforcement learning.
method Combines DDQN with Mamba and introduces a new reward function.
result Shows stronger theoretical support and better performance than original model.
Efficient algorithms improve learning of large-margin halfspaces.
problem Learning large-margin halfspaces efficiently and reproducibly.
method Design of efficient, dimension-independent, polynomial-time algorithms; SGD-based approach; DP-to-Replicability reduction.
result Improved sample complexity compared to previous algorithms, with optimal sample complexity for one algorithm.
This paper studies robust payoff allocation in submodular games, especially against replication.
problem Payoff allocation in submodular games, especially robustness against replication.
method Systematically studied replication manipulation in submodular games, introduced replication robustness metric, and validated with empirical ML data market.
result Conditions characterizing robustness of semivalues in submodular games.
The study examines a financial model with sticky prices and finds no arbitrage when interest rate is zero.
problem Analyzing financial markets with sticky asset prices and proving no arbitrage conditions.
method Introduced a financial market model with a risky asset following a sticky geometric Brownian motion and a riskless asset with a constant interest rate. Proved no arbitrage conditions and derived pricing equations.
result No arbitrage conditions are met only when the interest rate is zero, and all replicable payoffs are derived under this condition.
We develop a unified valuation theory that incorporates credit risk (defaults), collateralization and funding costs, by expanding the replication approach to a generality that has not yet been studied previously and reaching valuation when replication is not assumed. This unifying theoretical framework clarifies the re…
New algorithm ensures replicable results in multi-armed bandits with minimal extra regret.
problem Ensuring consistent results in multi-armed bandit studies.
method Incorporates randomness into decision-making to ensure replicability while maintaining minimal extra regret.
result For large time horizons, proposed algorithm suffers only times smaller amount of exploration than existing algorithms.
Neural Replicator Dynamics improves deep RL performance in nonstationary environments.
problem Nonstationarity and instability in multiagent reinforcement learning.
method Derive a new algorithm using replicator dynamics to bypass softmax in policy gradient methods.
result Neural Replicator Dynamics (NeuRD) outperforms policy gradient methods in nonstationary environments.
Continuous-time model shows how trading affects asset prices and optimizes investment strategies.
problem Modeling financial markets with transient price impact and optimal trading strategies.
method Establishes a continuous-time duality involving measures with martingales and a liquidity weighted norm.
result Optimality of buy-and-hold strategies for call options and utility maximizing investment strategies proved.
Study models interest rates as CTMC, pricing and replicating derivatives.
problem Modeling and pricing financial derivatives in a CTMC setting.
method Model short rate as CTMC, derive pricing and replication strategies, apply Ross Recovery Theorem.
result Derive real-world dynamics of CTMC.
Study liquidity provision in decentralized exchanges considering risk aversion and replication costs.
problem Economic viability of liquidity provision in decentralized exchanges (DEXs).
method Formulated strategic interactions as a sequential game with risk-averse LP, traders, and arbitrageurs.
result DEX liquidity depth is crucial for risk management, influenced by risk aversion and replication costs.
Financial factors selection with knockoffs: fund replication, explanatory and prediction networksq-fin.ST
Knockoffs method selects financial factors, controlling false discoveries.
problem Controlling false discoveries in financial factor selection.
method Apply knockoff procedure to build fake factors.
result Shows versatility in fund replication and network inference.
Modeling and Replication of the Prepayment Option of Mortgages including Behavioral Uncertaintyq-fin.CP
The study models mortgage prepayment risk, accounting for behavioral uncertainty, and provides replication strategies.
problem Modeling and replicating the prepayment option of mortgages with behavioral uncertainty.
method Modeling behavioral uncertainty as a non-hedgeable risk factor, proving its impact on exposure value, and using IRSs and swaptions for replication.
result Including behavioral uncertainty reduces the exposure's value, and swaptions are necessary for optimal replication.
Unified techniques improve stability and replicability in changing data.
problem Concept drift in data generating distribution.
method Removing hidden confounding and causal regularization.
result Improves stability, replicability, and robustness in heterogeneous data.
Study cash-flow forecasting for derivatives, aligning with replication strategy and addressing timing frictions.
problem Inconsistencies in cash-flow forecasting under different measures and stochastic payment times.
method Use discounting sensitivities (funding-curve hedge ratios) for replication and propose a liquidity valuation adjustment.
result Aligns forecasting with replication strategy and avoids measure-mixing issues.
Adaptive Batching for Gaussian Process Surrogates with Application in Noisy Level Set Estimationstat.ML
Adaptive batching improves Gaussian process surrogates for noisy level set estimation.
problem Learning the level set of noisy simulator responses.
method Developed four novel adaptive batching schemes for Gaussian process metamodels.
result Adaptive batching brings significant computational speed-ups with minimal loss of modeling fidelity.
Market Delay and G-expectationsq-fin.MF
We study super-replication of contingent claims in markets with delayed filtration. The first result in this paper reveals that in the Black--Scholes model with constant delay the super-replication price is prohibitively costly and leads to trivial buy-and-hold strategies. Our second result says that the scaling limit …
We show that when the price process represents a fully incomplete market, the optimal super-replication of any Markovian claim with being nonnegative and lower semicontinuous is of buy-and-hold type. Since both (unbounded) stochastic volatility models and rough volatility models are examples of …