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

Trend · papers per month

7152229 · May 202619922001200920172026
48 results for Codec Compatibility

We frame the problem of selecting an optimal audio encoding scheme as a supervised learning task. Through uniform convergence theory, we guarantee approximately optimal codec selection while controlling for selection bias. We present rigorous statistical guarantees for the codec selection problem that hold for arbitrar…

2018-12-18abs ↗pdf ↗

C3 compresses images and videos with low complexity and high performance.

problem High complexity and low performance in neural compression models.
method Overfits a small model to each image or video separately, improving RD performance with low complexity.
result Matches the RD performance of state-of-the-art neural and video codecs with significantly lower decoding complexity.

A novel method compresses point cloud attributes by folding them onto a 2D grid.

problem Efficiently compressing point cloud attributes for storage and transmission.
method Interpreting point clouds as 2D manifolds, folding onto a grid, and mapping attributes to the grid using optimized methods.
result The proposed folding-based approach achieves performance comparable to state-of-the-art codecs.

We present a machine learning-based approach to lossy image compression which outperforms all existing codecs, while running in real-time. Our algorithm typically produces files 2.5 times smaller than JPEG and JPEG 2000, 2 times smaller than WebP, and 1.7 times smaller than BPG on datasets of generic images across all …

2017-05-16abs ↗pdf ↗

In this paper, we present a novel approach for fine-tuning a decoder-side neural network in the context of image compression, such that the weight-updates are better compressible. At encoder side, we fine-tune a pre-trained artifact removal network on target data by using a compression objective applied on the weight-u…

2019-05-10abs ↗pdf ↗

Neural codec for high-fidelity audio compression.

problem Efficiently compress audio while maintaining high quality.
method End-to-end neural network architecture with quantized latent space, single multiscale spectrogram adversary, loss balancer mechanism, and lightweight Transformer compression.
result 40% compression with no loss in quality, faster than real-time.

We present a new algorithm for video coding, learned end-to-end for the low-latency mode. In this setting, our approach outperforms all existing video codecs across nearly the entire bitrate range. To our knowledge, this is the first ML-based method to do so. We evaluate our approach on standard video compression test …

2018-11-16abs ↗pdf ↗

The usage of deep generative models for image compression has led to impressive performance gains over classical codecs while neural video compression is still in its infancy. Here, we propose an end-to-end, deep generative modeling approach to compress temporal sequences with a focus on video. Our approach builds upon…

2018-10-05abs ↗pdf ↗

We propose a new approach to the problem of optimizing autoencoders for lossy image compression. New media formats, changing hardware technology, as well as diverse requirements and content types create a need for compression algorithms which are more flexible than existing codecs. Autoencoders have the potential to ad…

2017-03-01abs ↗pdf ↗

This work compresses sequences by treating them as continuous-time processes, enabling efficient discretization.

problem Efficient compression of sequences, especially with deep learning models that scale with sequence length.
method Treat sequences as continuous-time processes, learn efficient discretization, and decode at different time intervals.
result Automatic bit rate reductions in video and motion capture sequences using learned discretization.

Defines compatibility between Jacobi structures and pseudo-Riemannian metrics on Jacobi algebroids.

problem Generalizing compatibility between Poisson and pseudo-Riemannian metrics to Jacobi structures.
method Introduces and studies compatibility conditions for Jacobi structures and pseudo-Riemannian metrics on Jacobi algebroids.
result Compatibility conditions are preserved under Poissonization and equivalent to Sasakian structures for contact pseudo-metrics.

The paper characterizes compatible linear connections on 3D Finsler manifolds.

problem Characterizing compatible linear connections on Finsler manifolds of dimension three.
method Intrinsic method to characterize compatible linear connections, focusing on indicatrices and Euclidean symmetries.
result If a compatible linear connection is not unique, indicatrices must be Euclidean surfaces of revolution.

New method compresses facial videos using GANs and latent space optimization.

problem Efficiently compressing facial videos at low bit rates.
method Leverages StyleGAN for latent space representation and compression, learns optimal compression through entropy model and perceptual loss.
result Significantly reduces perceptual distortion at low bit rates compared to state-of-the-art codecs.

The paper proposes reusable network components by making them compatible across tasks.

problem Training networks for different tasks independently leads to incompatible components.
method The paper splits a network into a features extractor and a target task head, and proposes various approaches to make them compatible.
result The proposed methods produce components that are directly compatible without compromising accuracy on original tasks.

Proves compatibility of light cones and projective structures.

problem Clarifying different concepts of compatibility between conformal and projective structures.
method Analyzes compatibility criteria introduced by Ehlers-Pirani-Schild and Trautman-Scholz.
result Proves that the compatibility criterion introduced by Ehlers-Pirani-Schild is correct.

The paper investigates compatible linear connections on Randers spaces and finds a unique extremal connection.

problem Investigating compatible linear connections on Randers spaces.
method Transformed compatibility equations by taking torsion components as variables and determined when these equations have solutions.
result Characterized Randers spaces as non-Riemannian generalized Berwald spaces with a positive constant norm of perturbing term.

The paper studies properties of group relations induced by compatible coarse structures.

problem Properties of asymptotic resemblance relations on groups.
method Generalization of asymptotic dimension and introduction of set theoretic coupling.
result Groups with compatible coarse structures that admit a set theoretic coupling are asymptotic equivalent.

Derdzinski and Shen's theorem on the restrictions posed by a Codazzi tensor on the Riemann tensor holds more generally when a Riemann-compatible tensor exists. Several properties are shown to remain valid in this broader setting. Riemann compatibility is equivalent to the Bianchi identity of the new "Codazzi deviation …

2012-04-05abs ↗pdf ↗

We disprove the generalized Chern-Hamilton conjecture on the existence of critical compatible metrics on contact 33-manifolds. More precisely, we show that a contact 33-manifold (M,α)(M,α) admits a critical compatible metric for the Chern-Hamilton energy functional if and only if it is Sasakian or its associated Reeb fl…

2023-11-27abs ↗pdf ↗

Some general properties of compatible Poisson brackets of hydrodynamic type are discussed, in particular: (1) an invariant differential-geometric criterion of the compatibility based on the Nijenhuis tensor; (2) the Lax pair with a spectral parameter governing compatible Poisson brackets in the diagonalizable case; (3)…

2000-05-23abs ↗pdf ↗

The construction of gauge theories beyond the realm of Lie groups and algebras leads one to consider Lie groupoids and algebroids equipped with additional geometrical structures which, for gauge invariance of the construction, need to satisfy particular compatibility conditions. This paper analyzes these compatibilitie…

2016-03-14abs ↗pdf ↗

New proof for unique semi-symmetric compatible linear connection on Finsler manifolds.

problem Existence and uniqueness of semi-symmetric compatible linear connections on Finsler manifolds.
method New linear algebra proof without integration, using convex body properties and intrinsic equations.
result Uniqueness of semi-symmetric compatible linear connection proved.

New method improves compatibility of risk stratification models without sacrificing accuracy.

problem Compatibility issues arise when updating clinical machine learning models.
method Proposes rank-based compatibility measure and new loss function.
result Increased compatibility of models by 0.019 with no loss in discriminative performance.

The study examines backward compatibility issues in ML systems, especially with noisy data.

problem Backward compatibility challenges in ML systems, especially with noisy data.
method Empirical analysis of ML systems across different architectures and datasets, focusing on data shifts and noise.
result Backward compatibility issues arise even without data shift due to optimization stochasticity and training on large-scale noisy datasets can significantly decrease compatibility.

Generalized Lagrange-Weyl structures and compatible connections are introduced as a natural generalization of similar notions from Riemannian geometry. Exactly as in Riemannian case, the compatible connection is unique if certain symmetry conditions with respect to vertical and horizontal Christoffel symbols are impose…

2006-05-24abs ↗pdf ↗

AI systems are being deployed to support human decision making in high-stakes domains. In many cases, the human and AI form a team, in which the human makes decisions after reviewing the AI's inferences. A successful partnership requires that the human develops insights into the performance of the AI system, including …

2019-06-04abs ↗pdf ↗

Modality-agnostic compression improves across diverse data types.

problem Efficiently compressing data across multiple modalities.
method Functional view of data, Implicit Neural Representation (INR), modality-agnostic latent representations, variational compression.
result Improved performance compared to existing methods, especially for diverse modalities.

No-regret learning with strategic experts, incentivized.

problem Online learning with strategic experts who misreport beliefs.
method Building on wagering mechanisms, we provide algorithms for no-regret and incentive compatibility in both full and partial information settings.
result Our algorithms achieve no regret and incentive compatibility for myopic experts, with comparable regret to classic no-regret algorithms and diminishing regret for forward-looking agents.