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

16334965 · May 202619922001200920172026
48 results for TV Volatility

New method estimates convergence bounds for nonlinear Markov chains.

problem Difficulty in describing properties of nonlinear Markov chains.
method Coupling Markov chains to reconstitute distribution relationships and estimate convergence bounds.
result Estimation of convergence bounds is more precise than existing results.

Paper proposes a two-stage ranking for personalized TV recommendations.

problem Improving TV recommendation accuracy and efficiency.
method First, identifies potential candidates using user viewing patterns. Then, ranks them based on user preferences and program textual information.
result The proposed model outperforms in recommendation accuracy and efficiency.

The paper examines how to test if two learning algorithms produce similar outcomes.

problem Testing if two learning algorithms produce similar outcomes when trained on different data sets.
method Using Total Variation (TV) distance to measure similarity of posterior distributions.
result TV indistinguishable learning rules are equivalent to existing stability notions and can be statistically amplified.

New method relaxes TV distance for two-sample testing without distributional assumptions.

problem Challenges in certifying equality or providing tight bounds on TV distance for two distributions.
method Examined blurred total variation distance, a relaxation of TV distance.
result Provided theoretical guarantees for upper and lower bounds on blurred TV distance.

TVS-FNNs can approximate any continuous function on expanded input spaces.

problem Processing a broader range of inputs like sequences and matrices.
method Proving a universal approximation theorem for TVS-FNNs.
result TVS-FNNs can approximate any continuous function on expanded input spaces.

The purpose of this paper is to propose a time-varying vector autoregressive model (TV-VAR) for forecasting multivariate time series. The model is casted into a state-space form that allows flexible description and analysis. The volatility covariance matrix of the time series is modelled via inverted Wishart and singul…

2008-02-01abs ↗pdf ↗

Characterizing the phase transitions of convex optimizations in recovering structured signals or data is of central importance in compressed sensing, machine learning and statistics. The phase transitions of many convex optimization signal recovery methods such as 1\ell_1 minimization and nuclear norm minimization are…

2015-09-15abs ↗pdf ↗

Study on kinetic Langevin diffusions and their couplings, showing subtle TV bounds and new non-Markovian couplings.

problem Understanding and quantifying the TV distance between solutions of kinetic Langevin diffusions with different initial values.
method Established new non-Markovian couplings for kinetic Langevin diffusions, derived from optimal coalescence trajectories, and analyzed their TV bounds.
result No Markovian coupling can capture the asymptotic decay rate of the TV distance between solutions of kinetic Langevin diffusions with different initial values.

Computer Vision and machine learning methods were previously used to reveal screen presence of genders in TV and movies. In this work, using head pose, gender detection, and skin color estimation techniques, we demonstrate that the gender disparity in TV in a South Asian country such as Bangladesh exhibits unique chara…

2017-11-14abs ↗pdf ↗

This paper accelerates TV regularization algorithms by unrolling proximal gradient descent.

problem Solving Total Variation (TV) regularized problems with iterative algorithms.
method Unrolling proximal gradient descent solvers to learn their parameters.
result Two approaches to compute derivatives through proximal operators improve performance.

Sharp inequality between TV and Hellinger distances for Gaussian mixtures.

problem Understanding the relationship between total variation and Hellinger distances for Gaussian mixtures.
method Established a general upper bound on Hellinger distance in terms of TV distance raised to a power, demonstrating sharpness with specific examples.
result The Hellinger distance between two Gaussian mixtures is bounded by the TV distance raised to a power 1o(1)1-o(1), where o(1)o(1) is of order 1/loglog(1/TV)1/\log\log(1/\mathrm{TV}).

Paper proposes a method to estimate total variation distance for synthetic data fidelity.

problem Assessing the fidelity of synthetic data generated by AI.
method Discriminative approach to estimate total variation distance between two distributions.
result Estimation of total variation distance reduces to quantifying Bayes risk in classification.

Decision trees and shallow neural networks have different geometric complexities, impacting their interpretability and accuracy.

problem The geometric simplicity of decision boundaries in decision trees conflicts with the approximation capabilities of shallow neural networks.
method Analysis of the Radon total variation (RTV) seminorm to compare geometric complexity of decision regions and neural network approximations.
result Smooth barrier scores can approximate decision regions with finite RTV, but their performance depends on the tube-mass condition near the decision boundary.

RFM uses tangent vector fields to match data on manifolds, analyzing TV convergence for Euler discretization.

problem Matching data on curved manifolds using flow-based models.
method Developed a nonasymptotic TV convergence analysis for RFM samplers using Euler discretization.
result Explicit bounds on TV convergence separating numerical discretization and learning errors.

Study sample complexity of robust binary hypothesis testing under different contamination models.

problem Analyzing the sample complexity of robust binary hypothesis testing under various contamination models.
method Examined three standard contamination models: ε-additive (Huber), ε-subtractive, and ε-total variation (TV). Provided explicit formulas for least favourable distributions and compared sample complexities across models.
result Sample complexities are highly unstable in the contamination parameter ε and comparable up to constant-factor rescaling of ε across models.

A new RL framework allows removing user data without affecting performance.

problem Efficiently removing user data from a reinforcement learning model without affecting performance.
method Formulated a ρρ-TV-stable RL algorithm for tabular MDPs that supports exact unlearning.
result Achieved a nearly minimax optimal regret bound of Ω(H ⁣SAT ⁣+ ⁣SAH/ρ)Ω(H\sqrt{\!SAT}\! +\! {SAH}/ρ) for ρρ-TV-stable RL algorithms.

TV-SurvCaus improves causal inference for dynamic treatments in survival analysis.

problem Estimating causal effects of time-varying treatments on survival outcomes.
method Representation balancing techniques extended to time-varying treatment regimes with survival outcomes.
result TV-SurvCaus outperforms existing methods in estimating individualized treatment effects with time-varying covariates and treatments.

We analyze the performance of the Tukey median estimator under total variation (TV) distance corruptions. Previous results show that under Huber's additive corruption model, the breakdown point is 1/3 for high-dimensional halfspace-symmetric distributions. We show that under TV corruptions, the breakdown point reduces …

2020-01-21abs ↗pdf ↗

Let B_n be the braid group on n strands, with n at least 4, and let Mod(S) be the extended mapping class group of the sphere with n+1 punctures. We show that the abstract commensurator of B_n is isomorphic to a semidirect product of Mod(S) with a group we refer to as the transvection subgroup, Tv(B_n). We also show tha…

2005-01-26abs ↗pdf ↗

We present 27 problems encountered in automating the translation of movie/TV show subtitles. We categorize each problem in one of the three categories viz. problems directly related to textual translation, problems related to subtitle creation guidelines, and problems due to adaptability of machine translation (MT) eng…

2019-09-04abs ↗pdf ↗

New method for tensor completion using nonconvex dual total variation.

problem Tensor completion from partial measurements with exponential-family noise.
method Proposed dual-TV (DTV) regularizers for tensor completion under exponential-family noise.
result Theoretical upper bounds on recovery error for tensor completion.

We establish a relation between the "large r" asymptotics of the Turaev-Viro invariants TVrTV_r and the Gromov norm of 3-manifolds. We show that for any orientable, compact 3-manifold MM, with (possibly empty) toroidal boundary, logTVr(M)\log |TV_r (M)| is bounded above by a function linear in rr and whose slope is a positiv…

2017-05-28abs ↗pdf ↗

Optimal algorithm for LQR control with improved regret bound.

problem Nonstochastic control with quadratic losses (LQR control).
method Online algorithm with optimal dynamic regret of ildeO(extmax{n1/3TV(M1:n)2/3,1}) ilde{O}( ext{max}\{n^{1/3} \mathcal{TV}(M_{1:n})^{2/3}, 1\}).
result Improves the best known rate of ildeO(n(TV(M1:n)+1)) ilde{O}(\sqrt{n (\mathcal{TV}(M_{1:n})+1)} ) for general convex losses.

Paper tackles Byzantine attacks in distributed learning with a new ADMM method.

problem Byzantine workers sending arbitrary messages bias distributed learning.
method Byzantine-robust stochastic ADMM exploiting separable problem structure.
result Proposed method converges to optimal solution at O(1/k) rate.

A generalized additive model (GAM, Hastie and Tibshirani (1987)) is a nonparametric model by the sum of univariate functions with respect to each explanatory variable, i.e., f(x)=fj(xj)f({\mathbf x}) = \sum f_j(x_j), where xjRx_j\in\mathbb{R} is jj-th component of a sample xRp{\mathbf x}\in \mathbb{R}^p. In this paper, we introd…

2018-02-08abs ↗pdf ↗

In this paper we study the estimation of changing trends in time-series using 1\ell_1 trend filtering. This method generalizes 1D Total Variation (TV) denoising for detection of step changes in means to detecting changes in trends, and it relies on a convex optimization problem for which there are very efficient numer…

2014-12-01abs ↗pdf ↗

Consider the following problem: given two arbitrary densities q1,q2q_1,q_2 and a sample-access to an unknown target density pp, find which of the qiq_i's is closer to pp in total variation. A remarkable result due to Yatracos shows that this problem is tractable in the following sense: there exists an algorithm that use…

2019-02-10abs ↗pdf ↗

Bayesian model reduces TV watching data to 11 parameters for churn prediction.

problem Predicting customer churn in telecommunications with high-dimensional data.
method Bayesian hierarchical joint model for time-to-event and count data.
result Model reduces data from thousands to 11 customer-level parameter estimates.

This work improves the Euler method for masked diffusion models, providing tighter convergence guarantees.

problem Improving the convergence rates of masked diffusion models.
method Developed a direct total-variation (TV) based analysis for the Euler method, relaxing assumptions and improving parameter dependencies.
result Established convergence guarantees for the Euler sampler without requiring surrogate initialization, and provided a tight lower bound.

This paper deals with continuity preservation when minimizing generalized total variation with a L2L^2 fidelity term or a Dirichlet boundary condition. We extend several recent results in the two cases, mainly by showing comparison principles for the prescribed mean curvature problem satisfied by the level-sets of such…

2016-05-31abs ↗pdf ↗