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

Trend · papers per month

285583110 · Jun 202019922001200920172026
48 results for Time-Varying Links

A new approach corrects bias in federated learning due to varying communication links.

problem Bias in federated learning due to non-uniform and time-varying communication links.
method Proposes Federated Postponed Broadcast (FedPBC) to correct bias in Federated Average (FedAvg).
result FedPBC converges to a stationary point of the global objective, overcoming bias caused by varying communication links.

The paper proposes a method to train time-varying generative models using natural gradients.

problem Training time-varying generative models efficiently and accurately.
method Projecting generative model parameters onto an exponential family manifold and optimizing using natural gradient descent.
result The proposed method efficiently approximates the natural gradient and can be applied to various exponential family models.

No-regret optimization for time-varying functions using uncertainty injection.

problem Optimizing time-varying functions with no-regret in bandit feedback.
method W-SparQ-GP-UCB, incorporating uncertainty injection and additional queries.
result Achieves no-regret with a vanishing number of additional queries per iteration.

This paper solves optimal consumption-investment problems with time-varying preferences.

problem Optimal consumption-investment problems under time-varying incomplete preferences.
method Develops a martingale-type solution in a topological vector space, using stochastic processes and scalarization methods.
result Optimal investment policies are set-valued, with selectors decomposed into four components.

The paper analyzes time-dependent streaming data with biased gradient estimates and proposes improved stochastic optimization methods.

problem Stochastic optimization in a streaming setting with time-dependent and biased gradient estimates.
method Analysis of several first-order methods including SGD, mini-batch SGD, and time-varying mini-batch SGD, along with their Polyak-Ruppert averages.
result Time-varying mini-batch SGD methods can break long- and short-range dependence structures, and biased SGD methods can achieve comparable performance to their unbiased counterparts.

Study examines how industrial emissions evolve over time in response to various factors.

problem Understanding how firm-level emissions change over time in response to environmental regulation, economic conditions, and organizational constraints.
method Used a time-varying mean-group estimator to link emissions data with firm characteristics and macroeconomic indicators over 1992-2023.
result Firm-level characteristics and aggregate conditions have different impacts on emissions growth at different times.

Extends tracking guarantees for time-varying variational inequalities.

problem Tracking solutions of time-varying variational inequalities.
method Extends existing results to sublinear solution paths and periodic problems.
result Discrete dynamical systems of periodic time-varying VI can exhibit chaotic behavior or converge to the solution.

Enhanced Gordon growth model for valuing financial products.

problem Valuation of financial products with time-varying interest rates and dividends.
method Dynamic Gordon growth model with time-varying spot interest rate and dividends, risk-neutral valuation, locally risk-minimizing strategy.
result Pricing and hedging formulas for dividend-paying European options and equity-linked life insurance products.

Develops a method to predict stock returns with time-varying risk premia.

problem Predicting stock returns with time-varying risk premia while maintaining no-arbitrage restrictions.
method Penalized two-pass regression with time-varying factor loadings, incorporating penalization in the first pass and grouping in the second pass.
result The proposed method reduces prediction errors compared to other approaches.

Estimates time-varying network connections using multi-stage smoothing.

problem Estimating edge probabilities of time-varying networks.
method Multi-stage smoothing: temporal local smoothing followed by node-domain smoothing.
result Captures both smooth temporal evolution and structural patterns in connectivity.

Wireless communication systems operate in complex time-varying environments. Therefore, selecting the optimal configuration parameters in these systems is a challenging problem. For wireless links, \emph{rate selection} is used to select the optimal data transmission rate that maximizes the link throughput subject to a…

2019-02-28abs ↗pdf ↗

AUASE embeds dynamic networks with stability guarantees for node comparison.

problem Stability in dynamic network embeddings for comparing nodes across time.
method Attributed unfolded adjacency spectral embedding (AUASE) for stable unsupervised learning.
result AUASE provides significant improvements in link prediction and node classification.

Paper tackles hyper-gradient estimation in decentralized FL over time-varying networks.

problem Excessive communication costs and inability to use robust networks.
method Introduces an optimality condition and uses Push-Sum for averaging model parameters and gradients over time-varying directed networks.
result Derives a hyper-gradient estimator that operates over time-varying directed networks and converges to the true hyper-gradient.

New methods estimate survival functions with time-varying covariates.

problem Estimating survival functions with time-varying covariates.
method Generalized conditional inference and relative risk forests, adapted transformation forest.
result Proposed methods outperform traditional models in estimating survival functions.

The present paper considers distributed consensus algorithms that involve N agents evolving on a connected compact homogeneous manifold. The agents track no external reference and communicate their relative state according to a communication graph. The consensus problem is formulated in terms of the extrema of a cost f…

2008-11-26abs ↗pdf ↗

The paper develops methods for time-varying constrained online convex optimization.

problem Time-varying loss and constraint functions in online convex optimization.
method Model-based augmented Lagrangian methods (MALM) for time-varying and delayed feedback.
result Sublinear regret and constraint violation for both time-varying and delayed feedback scenarios.

TVBO optimizes time-varying functions with asymptotically vanishing regret.

problem Understanding the asymptotic performance of TVBO for time-varying black-box functions.
method Provided upper and lower bounds for cumulative regret of TVBO algorithms.
result TVBO algorithms can achieve asymptotically vanishing regret under certain conditions.

The paper analyzes equity market dynamics and optimal portfolios using time-varying optimization.

problem Analyzing the time-varying structure of equity markets, particularly market capitalization inequality and concentration.
method The study employs mathematical functionals of time-varying portfolios and a Sharpe optimization procedure.
result Optimal portfolios exhibit varying market capitalization exposure over time.

New model captures time-varying volatility with stochastic exponential tails.

problem Capturing time-varying volatility and stochastic skewness in financial markets.
method Normal Tempered Stable distribution with time-varying parameter.
result Model better explains market option prices with stochastic exponential tails.

Developed a flexible Bayesian g-formula for causal survival analysis with time-dependent confounding.

problem Estimating causal survival curves in longitudinal observational studies with time-varying treatments and confounding.
method Incorporated Bayesian Additive Regression Trees (BART) into the g-formula to model time-evolving generative components and mitigate bias due to model misspecification.
result Demonstrated improved empirical performance and practical utility of the proposed method through simulations and real-world data analysis.

Estimates financial market impacts of COVID-19 using time-varying kernel density.

problem Estimating the impact of COVID-19 on financial markets over time.
method Time-varying kernel density estimation with Kolmogorov-Smirnov statistic.
result Determines the chronology and regional disparities of financial market impacts.

New TVBO algorithm optimizes time-varying functions with varying sampling frequencies.

problem Optimizing time-varying, expensive, noisy functions with constant frequency assumption.
method Formulated practical recommendations and derived upper regret bound for varying sampling frequencies.
result BOLT algorithm outperforms state-of-the-art TVBO algorithms in experiments.

A pairs trading model with time-varying volatility using stochastic control.

problem Optimizing pairs trading strategies with fluctuating asset volatilities.
method Stochastic control techniques, Finite Difference method, Generalized Method of Moments.
result Optimal trading strategies maximizing expected power utility from terminal wealth.

Paper tackles dynamic graph topology identification in time-varying graphs.

problem Dynamic graph topology identification in time-varying graphs.
method Proposes an online algorithm for time-varying optimization, with intrinsic temporal regularization.
result Demonstrates performance on Gaussian graphical model problem.

We propose a dynamic edge exchangeable network model that can capture sparse connections observed in real temporal networks, in contrast to existing models which are dense. The model achieved superior link prediction accuracy on multiple data sets when compared to a dynamic variant of the blockmodel, and is able to ext…

2017-10-11abs ↗pdf ↗

A new method learns dynamic graph representations from time-varying data.

problem Learning dynamic graph representations from time-varying data.
method Higher-order skip-gram with negative sampling (HOSGNS) for tensor factorization.
result HOSGNS outperforms state-of-the-art methods in downstream tasks.

Study compares optimal vs. naive diversification in crypto markets, finds time-varying moments improve performance.

problem Optimizing portfolio construction in volatile crypto markets.
method Examines time-varying moments and transaction costs, incorporates turnover penalty.
result Time-varying moment estimators outperform conventional estimators in practical portfolio construction.

Proposes estimators for complex dose-response curves using kernel methods.

problem Estimating complex dose-response curves with continuous treatments, mediators, and covariates.
method Kernel ridge regression with sequential kernel embedding technique.
result Simple estimators for mediated and time-varying dose response curves with nonasymptotic uniform rates.

Time-varying parameters are shown to be ridge regressions, simplifying computations and tuning.

problem Capturing structural change in economic data.
method Ridge regression approach, including cross-validation for tuning, and extensions for sparsity and reduced-rank restrictions.
result The method efficiently estimates large numbers of time-varying parameters, demonstrated with Canadian monetary policy data.

New algorithm reduces dynamic regret in time-varying movement costs.

problem Dynamic regret in online convex optimization with time-varying movement costs.
method Introduced a novel algorithm for time-varying movement costs, achieving comparator-adaptive dynamic regret bound.
result Established first comparator-adaptive dynamic regret bound of O~((M2+MPT)(T+tλt))\widetilde{\mathcal{O}}(\sqrt{(M^2+MP_T)(T+\sum_t λ_t)}).

Paper proposes an EKF for estimating time-varying market efficiency.

problem Estimating time-varying market efficiency under nonlinear dynamics.
method Extended Kalman Filter (EKF) for time-varying autoregressive models.
result U.S. market generally remained weak-form efficient since mid-1946.

New streaming methods improve convergence rates for optimization problems.

problem Optimizing large-scale, sequential data problems.
method Time-varying mini-batches and Polyak-Ruppert averaging for gradient-based algorithms.
result Time-varying mini-batches and averaging achieve optimal convergence and variance reduction.

This study evaluates prewar Japanese financial market efficiency using time-varying models.

problem Determining when prewar Japanese financial market lost its price formation function.
method Time-varying parameter model, generalized least squares-based time-varying vector autoregressive model.
result The prewar Japanese financial market lost its price formation function in 1932.

Extends double linear policy with time-varying weights and proves robust positive expectation.

problem Ensuring robustness in policy optimization with time-varying parameters.
method Employed a novel elementary symmetric polynomials characterization approach to prove robust positive expectation (RPE). Derived explicit expressions for expected cumulative gain-loss and variance.
result Proved the robust positive expectation property holds for the extended double linear policy.