This paper provides a block coordinate descent algorithm to solve unconstrained optimization problems. In our algorithm, computation of function values or gradients is not required. Instead, pairwise comparison of function values is used. Our algorithm consists of two steps; one is the direction estimate step and the o…
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 “parallelized comparison”
In a context where most published articles are devoted to the development of "new methods", comparison studies are generally appreciated by readers but surprisingly given poor consideration by many scientific journals. In connection with recent articles on over-optimism and epistemology published in Bioinformatics, thi…
Synthetic splitting theorem for Lorentzian spaces with non-negative curvature.
problem Proving a splitting theorem for globally hyperbolic Lorentzian length spaces with non-negative timelike curvature.
method Synthetic approach using triangle comparison and parallelity of timelike lines.
result Establishes a splitting of a neighborhood of a complete timelike line, leading to global inextendibility.
This study compares parallel SMC and MCMC for Bayesian deep learning, showing SMC parallel is faster.
problem Efficiently performing Bayesian deep learning with parallel computing.
method Compared sequential Monte Carlo (SMC) and Markov chain Monte Carlo (MCMC) in parallel settings.
result Parallel SMC achieves similar convergence as a single SMC but with reduced communication time.
Improves BO efficiency by allowing asynchronous parallel computing.
problem Wasteful use of resources in batch Bayesian optimisation.
method Developed PLAyBOOK for asynchronous local penalisation.
result Asynchronous BO often outperforms synchronous BO.
Parallel neural network training yields better long-term prediction accuracy.
problem Choosing the right training strategy for neural networks in dynamical systems.
method Comparison of parallel and series-parallel training strategies on five neural network architectures and two examples.
result Parallel training consistently outperforms series-parallel training in long-term prediction accuracy.
New simulation shows trading algorithms' performance varies with parallelism.
problem Validation of trading algorithms' performance in parallel markets.
method Used TBSE, a threaded market simulator, to compare algorithms' performance.
result Trading algorithms' performance differs in parallel vs. sequential markets.
Introduces R package for contextual bandit algorithms.
problem Lack of standardized tools for comparing bandit algorithms.
method Object-oriented R package for parallelized comparison of contextual and context-free bandit policies.
result Facilitates simulation and offline analysis of bandit algorithms.
The importance of Einstein's geometrization philosophy, as an alternative to the least action principle, in constructing general relativity (GR), is illuminated. The role of differential identities in this philosophy is clarified. The use of Bianchi identity to write the field equations of GR is shown. Another similar …
We generalize Llarull's scalar curvature comparison to Riemannian manifolds admitting metric connections with parallel and alternating torsion and having a nonnegative curvature operator on 2-vectors. As a byproduct, we show that Euler number and signature of such manifolds are determined by their global holonomy repre…
Method predicts how probability distributions evolve over time.
problem Predicting how systems described by probability distributions evolve under different conditions.
method Wasserstein Parallel Transport
result Wasserstein Parallel Transport provides counterfactual comparisons of distributional dynamics.
Optimized parallel algorithms for identifying strong ties in data.
problem Identifying strong ties in data with varying distances and community sizes.
method Design and analysis of sequential and parallel algorithms for partitioned local depths.
result Optimized algorithms achieve up to 19.4x speedup in parallel execution.
Generalizes rigidity of scalar curvature for convex domains.
problem Rigidity of scalar curvature for convex domains.
method Harmonic spinors on convex domains with boundary conditions constructed by Brendle.
result Rigidity results on comparison of scalar curvature and scaled mean curvature on the boundary for any convex domain.
New framework PBBO optimizes latent functions with preferential feedback.
problem Optimizing latent functions with parallel preferential feedback.
method Gaussian process model with a likelihood for parallel comparisons.
result Framework PBBO generalizes and expands Bayesian optimization.
We establish what semi-discrete linear Weingarten surfaces with Weierstrass-type representations in -dimensional Riemannian and Lorentzian spaceforms are, confirming their required properties regarding curvatures and parallel surfaces, and then classify them. We then define and analyze their singularities. In partic…
There is significant recent interest to parallelize deep learning algorithms in order to handle the enormous growth in data and model sizes. While most advances focus on model parallelization and engaging multiple computing agents via using a central parameter server, aspect of data parallelization along with decentral…
The comparison theory for the Riccati equation satisfied by the shape operator of parallel hypersurfaces is generalized to semi-Riemannian manifolds of arbitrary index, using one-sided bounds on the Riemann tensor which in the Riemannian case correspond to one-sided bounds on the sectional curvatures. Starting from 2-d…
Proposes a new method for parallelizing SGD that combines partial results from all workers.
problem Slow workers (stragglers) cause convergence issues in synchronous SGD.
method Fixes worker computation time and combines partial results from all workers.
result Improves convergence significantly compared to existing methods.
Geometric framework for aligning fiber tracts across subjects.
problem Challenges in finding direct tract correspondence across multiple individuals.
method Geometric framework using intrinsic mean and deformation fields, parallel transport for registration.
result Bundle alignment results on 43 healthy adult subjects.
Discrete linear Weingarten surfaces with singularities in Riemannian and Lorentzian spaceformsmath.DG
In this paper we define and analyze singularities of discrete linear Weingarten surfaces with Weierstrass-type representations in -dimensional Riemannian and Lorentzian spaceforms. In particular, we discuss singularities of discrete surfaces with non-zero constant Gaussian curvature, and parallel surfaces of discret…
In this paper we deal with quadratic metric-affine gravity, which we briefly introduce, explain and give historical and physical reasons for using this particular theory of gravity. Further, we introduce a generalisation of well known spacetimes, namely pp-waves. A classical pp-wave is a 4-dimensional Lorentzian spacet…
The main objective of the present paper is to investigate the curvature properties of generalized pp-wave metric. It is shown that generalized pp-wave spacetime is Ricci generalized pseudosymmetric, 2-quasi-Einstein and generalized quasi-Einstein in the sense of Chaki. As a special case it is shown that pp-wave spaceti…
New algorithms for batched dueling bandits with improved regret bounds.
problem Batched dueling bandits with noisy pairwise comparisons.
method Developed algorithms for two settings: Condorcet winner and strong stochastic transitivity.
result Regret bounds match sequential bounds using only a logarithmic number of batches.
Study on Kähler Finsler manifolds with curvature bounds, proving theorems.
problem Understanding Kähler Finsler manifolds with curvature constraints.
method Analyzing partial parallelism of complex structure, proving theorems.
result Generalized comparison theorem for positively curved Kähler Finsler manifolds.
Improves sample efficiency in evolutionary policy search methods.
problem Worse sample efficiency in evolutionary policy search methods.
method Importance mixing to reuse more samples.
result Improves sample efficiency but still less than deep reinforcement learning.
DeepcomplexMRI uses deep residual networks for faster MRI imaging.
problem Accelerating parallel MR imaging with high accuracy.
method Deep complex convolutional neural network with residual connections and k-space consistency.
result The method can accurately reconstruct multi-channel MRI images.
Efficient Preference-Based Reinforcement Learning: Randomized Exploration Meets Experimental Designcs.LG
Meta-algorithm for efficient reinforcement learning from human preferences.
problem Learning from human preference comparisons in Markov decision processes.
method Randomized exploration and experimental design for batch comparison queries.
result Meta-algorithm achieves both regret and last-iterate guarantees with minimal preference queries.
The paper proves geometric rigidity using harmonic twisted spinors and scalar curvature comparison.
problem Proving geometric rigidity for closed Riemannian spin manifolds with specific properties.
method Using Gromov's exact-lift two-form method and harmonic spinors to analyze scalar curvature.
result The original metric is Einstein, and the universal cover is real hyperbolic in the positive-spectrum case.
POAP and pySOT improve surrogate optimization of expensive functions.
problem Optimizing expensive functions with concurrent evaluations.
method Event-driven asynchronous framework for optimization strategies.
result Asynchronous computation offers significant speed-up advantages.
Som-Raychaudhuri spacetime is a stationary cylindrical symmetric solution of Einstein field equation corresponding to a charged dust distribution in rigid rotation. The main object of the present paper is to investigate the curvature restricted geometric structures admitting by the Som-Raychaudhuri spacetime and it is …
Unsupervised comparable corpora preparation and exploration for bi-lingual translation equivalentscs.CL
The multilingual nature of the world makes translation a crucial requirement today. Parallel dictionaries constructed by humans are a widely-available resource, but they are limited and do not provide enough coverage for good quality translation purposes, due to out-of-vocabulary words and neologisms. This motivates th…
Study curve shortening flows on specific surfaces, proving properties and existence.
problem Analyzing curve shortening flows on rotational surfaces with negative Gauss curvatures.
method Assume negative Gauss curvatures and conditions on Gauss curvature and curve curvature. Prove curve remains a graph and establish flow properties.
result Prove the curve remains a graph over parallels and establish long-time existence of the flow.
Proposes learning default hyperparameters from empirical results.
problem Selecting optimal hyperparameters for machine learning algorithms.
method Learning a set of complementary default values from a database of prior empirical results.
result Learning default values improves performance and is more efficient than random search and Bayesian Optimization.
New algorithm for Gaussian process classification using posterior linearisation.
problem Improving Gaussian process classification performance.
method Posterior linearisation to approximate posterior density iteratively, accounting for linearisation error.
result PL has better performance than EP in experimental data.
Deep-SLR reduces SLR complexity with CNN, enabling efficient parallel MRI.
problem High computational complexity in SLR matrix completion.
method Convolutional Neural Network (CNN) trained to estimate annihilation relations from imperfect k-space measurements.
result Significant reduction in runtime by three orders of magnitude compared to SLR schemes.
Off-policy reinforcement learning has many applications including: learning from demonstration, learning multiple goal seeking policies in parallel, and representing predictive knowledge. Recently there has been an proliferation of new policy-evaluation algorithms that fill a longstanding algorithmic void in reinforcem…
In this paper we consider the collaborative ranking setting: a pool of users each provides a small number of pairwise preferences between possible items; from these we need to predict preferences of the users for items they have not yet seen. We do so by fitting a rank score matrix to the pairwise data, and pro…
Accelerated magnetic resonance (MR) scan acquisition with compressed sensing (CS) and parallel imaging is a powerful method to reduce MR imaging scan time. However, many reconstruction algorithms have high computational costs. To address this, we investigate deep residual learning networks to remove aliasing artifacts …
Nested Slice Sampling accelerates Nested Sampling for GPU acceleration.
problem Challenging inference for complex, multimodal targets.
method Vectorized Nested Slice Sampling using Hit-and-Run Slice Sampling.
result NSS maintains accurate evidence estimates and high-quality posterior samples, robust on multimodal problems.
In this paper, we propose a novel lower dimensional representation of a shape sequence. The proposed dimension reduction is invertible and computationally more efficient in comparison to other related works. Theoretically, the differential geometry tools such as moving frame and parallel transportation are successfully…
We prove three new monotonicity formulas for manifolds with a lower Ricci curvature bound and show that they are connected to rate of convergence to tangent cones. In fact, we show that the derivative of each of these three monotone quantities is bounded from below in terms of the Gromov-Hausdorff distance to the neare…
This paper is concerned with the problem of top- ranking from pairwise comparisons. Given a collection of items and a few pairwise comparisons across them, one wishes to identify the set of items that receive the highest ranks. To tackle this problem, we adopt the logistic parametric model --- the Bradley-Te…
We consider the predictive problem of supervised ranking, where the task is to rank sets of candidate items returned in response to queries. Although there exist statistical procedures that come with guarantees of consistency in this setting, these procedures require that individuals provide a complete ranking of all i…
This paper explores intrinsic rewards to improve learning from multiple value functions.
problem How to adapt reinforcement learning systems to optimize learning from multiple value functions.
method Investigated and compared 14 different intrinsic reward mechanisms in a new bandit-like parallel-learning testbed.
result Intrinsic rewards based on the amount of learning can generate useful behavior, if each individual learner is introspective.
The paper establishes a constant bound on Steklov and Laplacian spectra of manifolds with boundary.
problem Establishing a constant bound on Steklov and Laplacian spectra of manifolds with boundary.
method Quantitative relationship between Steklov eigenvalues and Laplacian eigenvalues on boundaries, using Pohozaev identity and comparison geometry.
result The difference between Steklov and Laplacian eigenvalues is bounded by a constant depending on the geometry of the neighborhood of the boundary.
Deep FPF approximates gain function for high-dimensional particle filtering.
problem Approximating the exact gain function in high-dimensional settings.
method Represent the gain function as a neural network gradient and solve a variational Poisson equation via optimization.
result The approach allows parallel processing of particles and is applicable to high-dimensional problems.
An absolute parallelism (AP-) space having Finslerian properties is called FAP-space. This FAP-structure is more wider than both conventional AP and Finsler structures. In the present work, more geometric objects as curvature and torsion tensors are derived in the context of this structure. Also second order tensors, u…
Study on learning dynamics in deep neural networks, proving properties and confirming empirical observations.
problem Understanding the learning dynamics of deep neural networks, especially in binary classification.
method Proved properties of learning in binary classification under strong assumptions, extended existing results from linear case.
result Classification error follows a sigmoidal shape in nonlinear architectures, parallel independent modes of learning, gradient starvation phenomenon.