AGGLIO optimizes non-convex functions with local convexity guarantees.
problem Optimizing non-convex functions with local convexity.
method Stage-wise, graduated optimization technique for locally convex functions.
result Global convergence to the global optimum for non-convex and locally convex objectives.
Study finds many nonplanar minimal spheres in elongated ellipsoids.
problem Existence of nonplanar minimal spheres in elongated ellipsoids.
method Global bifurcation techniques to establish existence and quantify number.
result Arbitrarily many nonplanar minimal spheres exist in elongated ellipsoids.
ClusterGraph visualizes and simplifies multidimensional data clusters for better understanding.
problem Lack of global structure information in clustering results.
method Combining clustering with Topological Data Analysis to provide global structure.
result ClusterGraph provides global layout information about clusters.
Combines global and local features for better social circle prediction in ego-networks.
problem Efficiently analyzing ego-networks with hidden local structures.
method Evolved deep learning techniques to capture both global and local network features.
result Social circle prediction benefits from a combination of global and local features.
A new L-BFGS method tackles large-scale optimization with fewer evaluations.
problem Efficiently solving large-scale unconstrained optimization problems.
method Proposes a regularized L-BFGS method with line search techniques.
result Shows global convergence and robust performance in numerical tests.
New group with non-loxodromic Morse element found.
problem Finding non-loxodromic Morse elements in groups.
method Small-cancellation techniques to construct a Morse local-to-global group.
result Found an infinite-order Morse element that is not loxodromic.
This paper surveys techniques to personalize federated learning models.
problem Personalized models outperform shared models for some clients, reducing participation.
method Surveys recent research on personalizing federated learning models.
result Personalization techniques improve model performance for individual clients.
This paper explores the limits of Transformers in learning new patterns from scratch.
problem Understanding when Transformers can learn new patterns from scratch.
method Introducing the 'globality degree' to measure learnability and developing scratchpad techniques.
result Distributions with high globality cannot be learned efficiently by Transformers.
New algorithm for nonstationary multi-armed bandits with optimal performance.
problem Nonstationary multi-armed bandits with changing model parameters over time.
method Adaptive Resetting Bandit (ADR-bandit) algorithm using adaptive windowing techniques.
result ADR-bandit achieves nearly optimal performance in both abrupt and gradual changes.
Bayesian optimization improves multi-start global optimization.
problem Global optimization challenges in real-world applications.
method Bayesian optimization framework to determine local search starting points.
result Bayesian optimization enhances the efficiency of multi-start local searches.
Local-to-global principle for Morse actions on symmetric spaces.
problem Recognizing Morse actions on symmetric spaces.
method Equivariant Morse quasiisometric embeddings of trees into symmetric spaces.
result Algorithmic recognizability of Morse actions and construction of Morse Schottky subgroups.
Bayesian optimization is a powerful global optimization technique for expensive black-box functions. One of its shortcomings is that it requires auxiliary optimization of an acquisition function at each iteration. This auxiliary optimization can be costly and very hard to carry out in practice. Moreover, it creates ser…
Bundling of graph edges (node-to-node connections) is a common technique to enhance visibility of overall trends in the edge structure of a large graph layout, and a large variety of bundling algorithms have been proposed. However, with strong bundling, it becomes hard to identify origins and destinations of individual…
In this study we introduce a new technique for symbolic regression that guarantees global optimality. This is achieved by formulating a mixed integer non-linear program (MINLP) whose solution is a symbolic mathematical expression of minimum complexity that explains the observations. We demonstrate our approach by redis…
Detects changes in global financial networks before crashes.
problem Financial contagion and crashes across global markets.
method Sequential change point detection in dynamic networks.
result Can detect changes in network behavior before stock market crashes.
Proposes a wave-constrained matrix factorization for signal learning.
problem Learning signals constrained by the wave equation.
method Wave-informed matrix factorization with global optimality guarantees.
result Proves global optimality of the proposed model in polynomial time.
Gradient descent proves global convergence for 4-layer matrix factorization.
problem Global convergence of gradient descent on four-layer matrix factorization under random initialization.
method New techniques to show saddle-avoidance properties and extend eigenvalue theories.
result Polynomial-time global convergence guarantee for randomly initialized gradient descent on four-layer matrix factorization.
We construct a global homeomorphism from any 3D Ricci limit space to a smooth manifold, that is locally bi-Holder. This extends the recent work of Miles Simon and the second author, and we build upon their techniques. A key step in our proof is the construction of local "pyramid Ricci flows", existing on uniform region…
Novel method for high-dimensional BO using CMA to define local regions.
problem Challenges in applying BO to high-dimensional optimization problems.
method CMA strategy to learn search distribution and define local regions.
result Our method outperforms existing techniques on various benchmarks.
Language is dynamic, constantly evolving and adapting with respect to time, domain or topic. The adaptability of language is an active research area, where researchers discover social, cultural and domain-specific changes in language using distributional tools such as word embeddings. In this paper, we introduce the gl…
Global homotopies upgrade classical map in differential geometry.
problem Upgrade classical Hochschild-Kostant-Rosenberg map to a deformation retract.
method Combining symbol calculus and coalgebraic van Est theorem.
result Develop deformation retracts in various settings.
Postprocessing reduces Bayesian optimization steps for global optima.
problem Slow convergence in Bayesian optimization for high-dimensional problems.
method Prohibits duplicated samples in the dataset postprocessing method.
result Significantly reduces the number of sequential steps to find the global optimum.
Advocates a local feedback approach for RL in unknown systems.
problem Finding optimal feedback laws in unknown nonlinear dynamical systems.
method Searches over a local feedback representation consisting of an open-loop sequence and an optimal linear feedback law.
result Results in highly efficient training and superior performance compared to global methods.
Improves medical note processing by training model on related concepts and global context.
problem Scarce and imbalanced labeled training data limits generalizability of automated abbreviation disambiguation models.
method Data augmentation using related medical concepts and global context information within medical notes.
result Model accuracy improved by almost 14% on CASI dataset and 4% on i2b2 dataset.
Global models outperform univariate benchmarks in complex time series forecasting.
problem Comparing global forecasting models to univariate benchmarks in various challenging scenarios.
method Simulated datasets with controlled characteristics, including homogeneity, complexity, and series lengths. Global forecasting models (RNN, LGBM) compared to univariate techniques.
result Global models like RNN and LGBM are competitive in complex scenarios with short series lengths and heterogeneous data.
Let M be a smooth 4-manifold which admits a genus g Lefschetz fibration over D^2 or S^2. We develop a technique to compute the signature of M using the global monodromy of this fibration.
LDLE embeds manifolds in lower dimensions with low distortion.
problem Embedding manifolds in lower dimensions with low distortion.
method Constructs local views using global eigenvectors of the graph Laplacian, registers them using Procrustes analysis, and tears manifolds apart for intrinsic dimension embedding.
result LDLE preserves distances up to a constant scale with low distortion.
This work studies the location estimation problem for a mixture of two rotation invariant log-concave densities. We demonstrate that Least Squares EM, a variant of the EM algorithm, converges to the true location parameter from a randomly initialized point. We establish the explicit convergence rates and sample complex…
This paper analyzes convergence of large-scale Transformers with weight decay.
problem Understanding optimization guarantees in large-scale Transformer training.
method Construct mean-field limit, show gradient flow convergence to PDE, demonstrate global minimum consistency.
result Gradient flow reaches global minimum in large-scale Transformers with small weight decay.
We give nearly matching upper and lower bounds on the oracle complexity of finding ε-stationary points (∥∇F(x)∥≤ε) in stochastic convex optimization. We jointly analyze the oracle complexity in both the local stochastic oracle model and the global oracle (or, statistical learning) model. This allows u…
With the advent of Deep Learning (DL) techniques, especially Generative Adversarial Networks (GANs), data augmentation and generation are quickly evolving domains that have raised much interest recently. However, the DL techniques are data demanding and since, medical data is not easily accessible, they suffer from dat…
Study finds multiple periodic solutions to ODEs related to curvature problems.
problem Finding multiple positive periodic solutions to quasilinear ODEs.
method Global bifurcation techniques applied to second order quasilinear ODEs.
result Bifurcation-theoretic proof of nonuniqueness for conformal metrics with constant scalar curvature.
The paper analyzes global inflation's systemic nature and its impact on equity markets.
problem Understanding the systemic nature of global inflation and its financial market implications.
method Data-driven study using eigenvalue analysis, inner-product optimization, and time-varying portfolio optimization.
result Countries with high centrality in global inflation are identified, and the robustness of equity indices and sectors during inflationary periods are explored.
Federated learning is an emerging technique used to prevent the leakage of private information. Unlike centralized learning that needs to collect data from users and store them collectively on a cloud server, federated learning makes it possible to learn a global model while the data are distributed on the users' devic…
Many real-world networks are complex dynamical systems, where both local (e.g., changing node attributes) and global (e.g., changing network topology) processes unfold over time. Local dynamics may provoke global changes in the network, and the ability to detect such effects could have profound implications for a numbe…
The present paper is devoted to the study a global aspect of the geometry of harmonic mappings and, in particular, infinitesimal harmonic transformations, and represents the application of our results to the theory of Ricci solutions and the Ricci flow. These results will be obtained using the methods of Geometric anal…
Proves global well-posedness for superquadratic BSDEs without Markovian assumption.
problem Global well-posedness of multidimensional superquadratic BSDEs without Markovian assumption.
method Interplay between local well-posedness of FBSDEs and backward iterations of superquadratic BSDEs.
result Global well-posedness of superquadratic BSDEs proved.
A new approach to distill unnormalized EBM for energy-based seq2seq models.
problem Training unnormalized EBM for energy-based seq2seq models is challenging.
method Relating the problem to distributional RL, proposing a general distillation approach.
result General approach applicable to any sequential EBM, illustrated on GAM experiments.
StochasticRank optimizes ranking metrics efficiently and guarantees global convergence.
problem Optimizing discrete ranking metrics due to their ill-posed nature.
method Stochastic smoothing, gradient estimate, debiasing, and Stochastic Gradient Langevin Boosting.
result Global convergence and superior performance on ranking datasets.
New methods improve global optimisation for expensive functions using lookahead strategies.
problem Optimising expensive functions without gradient info in high dimensions.
method Nonmyopic acquisition strategies based on approximate dynamic programming.
result Nonmyopic methods outperform myopic approaches in various applications.
We apply a novel spectral graph technique, that of locally-biased semi-supervised eigenvectors, to study the diversity of galaxies. This technique permits us to characterize empirically the natural variations in observed spectra data, and we illustrate how this approach can be used in an exploratory manner to highlight…
Paper constructs solutions for a class of overdetermined systems.
problem Constructing solutions for a class of overdetermined systems.
method Resolution of the solution sheaf, sufficient condition for global exactness, gluing techniques, local solvability of the Treves complex.
result Obtained a sufficient condition for global exactness, leading to gluing techniques for local solutions.
We establish global existence of smooth solutions to heat flow for Yang-Mills-Higgs functional on Kahler fibrations. As an application, we give a new proof of the key inequality for Mundet's Hitchin-Kobayashi correspondence theorem using the heat flow technique.
This paper finds a global surface of section in dynamically convex L(p,p-1) using ECH.
problem Finding a global surface of section in dynamically convex L(p,p-1).
method Using Embedded Contact Homology (ECH).
result Relates periods of the surface of section to the first ECH spectrum.
SCORE technique reduces BO's high-dimensional search costs.
problem Bayesian optimization's high computational costs in high-dimensional spaces.
method 1D reparametrization trick to maintain linear time complexity.
result Successfully finds global minimum in high-dimensional optimization.
Globally normalized neural sequence models are considered superior to their locally normalized equivalents because they may ameliorate the effects of label bias. However, when considering high-capacity neural parametrizations that condition on the whole input sequence, both model classes are theoretically equivalent in…
Novel proof technique for Gelfand-Fuks cohomology.
problem Comparing sheaf-like data over manifold Cartesian powers.
method Local-to-global analysis through generalized good covers and factorization algebras.
result Unified approach to Gelfand-Fuks cohomology.
The paper proves global invertibility for certain local diffeomorphisms and biholomorphisms in higher dimensions.
problem Global invertibility of local diffeomorphisms and biholomorphisms in higher dimensions.
method The approach uses conformal geometry, complex analysis, elliptic PDEs, and topology.
result The main theorem guarantees global invertibility for specific local diffeomorphisms and biholomorphisms in higher dimensions.