Study resolves polynomial germs, proving no mixed critical points and strict transform properties.
problem Resolving mixed critical points and properties of strict transforms of polynomial germs.
method Toric resolutions and modifications of weighted homogeneous polynomials.
result No mixed critical points and strict transform properties as germs.
Hot spots conjecture proven for small eigenvalue domains.
problem Hot spots conjecture for hyperbolic planar domains with small eigenvalues.
method Proved a variant of Rauch's hot spots conjecture.
result Second Neumann Laplace eigenfunctions have no interior critical points on large convex domains.
New framework for studying eigenvalue functionals of metrics.
problem Understanding critical points of eigenvalue functionals.
method Clarke subdifferential theory to unify previous research.
result Unified understanding of critical metrics and new examples.
Proposes a method to allocate time budgets in mixed criticality systems.
problem Managing execution time variability in mixed criticality systems.
method Quantifies execution time variability using statistical dispersion parameters and proposes a heuristic to allocate time budgets.
result The proposed heuristic reduces the probability of exceeding allocated budgets.
We examine the total mixed scalar curvature of a fixed distribution as a functional of a pseudo-Riemannian metric. We develop variational formulas for quantities of extrinsic geometry of the distribution to find the critical points of this action. Together with the arbitrary variations of the metric, we consider also v…
Post-training quantization method using multiple low-precision points achieves higher precision for critical weights.
problem Discretizing pre-trained deep neural networks without re-training.
method Multipoint quantization with efficient greedy selection and adaptive point number.
result Outperforms state-of-the-art methods on ImageNet classification and PASCAL VOC object detection.
In this paper, we propose a low-rank coordinate descent approach to structured semidefinite programming with diagonal constraints. The approach, which we call the Mixing method, is extremely simple to implement, has no free parameters, and typically attains an order of magnitude or better improvement in optimization pe…
New RL method MAC improves performance in sparse reward settings.
problem Slow mixing in large state spaces or sparse rewards.
method Multi-level Monte Carlo Actor-Critic (MAC) algorithm.
result Achieves convergence rate comparable to state-of-the-art AC algorithms.
We define new Riemannian structures on 7-manifolds by a differential form of mixed degree which is the critical point of a (possibly constrained) variational problem over a fixed cohomology class. The unconstrained critical points generalise the notion of a manifold of holonomy G2, while the constrained ones give ri…
Study of Einstein-Hilbert action on metric-affine spaces with connections.
problem Formulating and solving variational problems for mixed Einstein-Hilbert action.
method Developed variational formulas for extrinsic geometry, derived Euler-Lagrange equations, and characterized critical points.
result Derived new equations analogous to Einstein and Cartan equations, with a new Ricci type tensor.
The study proves constant-curvature analogues of hot spots conjecture for triangles.
problem Proving the hot spots conjecture in constant curvature domains.
method Analyzing geodesic triangles of constant negative curvature and using Killing fields.
result First mixed Dirichlet-Neumann Laplace eigenfunctions have no non-vertex critical points in constant curvature triangles.
A connected regular surface in Lorentz-Minkowski 3-space is called a mixed type surface if the spacelike, timelike and lightlike point sets are all non-empty. Lightlike points on mixed type surfaces may be regarded as singular points of the induced metrics. In this paper, we introduce the L-Gauss map around non-degener…
New study on No-U-Turn Sampler for accelerated mixing in Hamiltonian Monte Carlo.
problem Achieving accelerated convergence in Hamiltonian Monte Carlo.
method Combining concentration of measure and coupling analysis for mixing.
result Rigorous mixing guarantees for the No-U-Turn Sampler in certain Gaussian distributions.
Ancient curve shortening flow in a disc with mixed boundary conditions is solved.
problem Ancient curve shortening flow in a disc with mixed boundary conditions.
method Constructing convex eternal solutions and proving uniqueness.
result The only non-flat convex ancient solutions to the curve shortening flow satisfying the specified boundary conditions.
Study the relationship between braids formed by roots and critical points of polynomials.
problem Relationship between braid formed by roots and braid formed by critical points of polynomials.
method Analyzing pseudo-fibrations and fibrations of complex polynomials.
result For T-homogeneous braids, the pseudo-fibration can be a fibration.
Mixed integer programming identifies critical neurons in neural networks.
problem Identifying neurons critical for network performance and generalization.
method Developed a mixed integer program (MIP) to assign importance scores to neurons, guiding pruning decisions.
result The method identifies multiple 'lucky' sub-networks resulting in optimized architectures that generalize across datasets.
Researchers prove constant solutions for a specific Finslerian equation.
problem Investigating exponentially harmonic functions on Finslerian spaces.
method Analyzing the exponential energy functional and using nonnegative Ricci curvature conditions.
result Any bounded solution to the Finslerian equation is constant.
A mixed type surface is a connected regular surface in a Lorentzian 3-manifold with non-empty spacelike and timelike point sets. The induced metric of a mixed type surface is a signature-changing metric, and their lightlike points may be regarded as singular points of such metrics. In this paper, we investigate the beh…
Autoencoders provide a powerful framework for learning compressed representations by encoding all of the information needed to reconstruct a data point in a latent code. In some cases, autoencoders can "interpolate": By decoding the convex combination of the latent codes for two datapoints, the autoencoder can produce …
Milnor fibrations were extended by Mutsuo Oka for certain mixed polynomial. In this paper, we study singular points of differentiable maps into the 2-dimensional torus, called Milnor fibration product maps, obtained by several Milnor fibrations for mixed polynomial. We give a characterization of singular points of such…
Lower bound on BART's mixing time increases with data points.
problem Slow mixing time in BART's MCMC chains.
method Simplified BART with a single tree and reduced MCMC moves.
result Mixing time grows exponentially with data points.
This paper reverses a construction by merging boundary critical points into an interior one.
problem Pushing interior critical points to the boundary and splitting them into two boundary points.
method Specific assumptions allow merging two boundary critical points into one interior critical point.
result Merging two boundary critical points into a single interior critical point.
We consider a jump-type Cox--Ingersoll--Ross (CIR) process driven by a standard Wiener process and a subordinator, and we study asymptotic properties of the maximum likelihood estimator (MLE) for its growth rate. We distinguish three cases: subcritical, critical and supercritical. In the subcritical case we prove weak …
The minimal number of critical points is studied for smooth functions on closed manifolds.
problem Determining the minimal number of critical points for smooth functions on closed manifolds.
method Investigates cylindrical ball neighborhoods and exotic critical points, proving the conjecture for certain types of critical points.
result The minimal number of critical points is the same for smooth functions without exotic critical points on closed manifolds of dimension at least 6.
The paper connects Chern-Simons invariants to mixed Tate motives in hyperbolic 3-manifolds.
problem Understanding the relationship between Chern-Simons invariants and mixed Tate motives in hyperbolic 3-manifolds.
method Constructing a mixed Tate motive over the invariant trace field whose image equals the Chern-Simons invariant and complex volume.
result The mixed Hodge realization of the motive is a quotient of the path torsor of the augmented character variety.
A number of modern learning tasks involve estimation from heterogeneous information sources. This includes classification with labeled and unlabeled data as well as other problems with analogous structure such as competitive (game theoretic) problems. The associated estimation problems can be typically reduced to solvi…
Study on Bertrand lightcone framed curves in Lorentz-Minkowski 3-space.
problem Analyzing mixed types of curves with singular points in Lorentz-Minkowski 3-space.
method Using lightcone frame to consider Bertrand types for lightcone framed curves.
result Existence conditions of Bertrand lightcone framed curves in all cases.
TimeMixer predicts global financial asset volatility, excelling in short-term forecasts.
problem Predicting volatility in global financial markets is challenging due to complexity and non-linear dynamics.
method Uses TimeMixer, a multiscale-mixing model for forecasting across different scales.
result TimeMixer performs exceptionally well in short-term volatility forecasting but less so in longer-term predictions.
The study confirms a conjecture about critical points of smooth functions.
problem Understanding isolated critical points of smooth functions.
method Investigated cone-like, reasonable, and Rothe H hypothesis critical points.
result The conjecture holds true for certain critical points.
Hard to approximate critical points for simple nonconvex functions.
problem Approximating critical points of nonconvex functions.
method Proving hardness results for polynomial-time approximation of critical points.
result Proving that approximating critical points is intractable for simple nonconvex functions.
The paper proves a unique conformal measure for Anosov groups and shows local mixing.
problem Proving the uniqueness of conformal measures for Anosov groups.
method Analogue of Sullivan's theorem for Anosov subgroups of semisimple groups.
result Uniqueness of conformal measures and local mixing for Anosov groups.
The present research work proposes a new fast fixed-point averaging algorithm on the compact Stiefel manifold based on a mixed retraction/lifting pair. Numerical comparisons between fixed-point algorithms based on the proposed non-associated retraction/lifting map pair and two associated retraction/lifting pairs confir…
This work improves mixing rates for Bayesian CART, a key component of BART.
problem Understanding and improving mixing rates for Bayesian inference with MCMC.
method Derived upper bounds on mixing times, provided sufficient conditions for polynomial mixing, and proposed Twiggy Bayesian CART.
result Twiggy Bayesian CART achieves polynomial mixing without assuming signal connectivity.
New MIP approach for efficient change-point detection.
problem Offline multiple change-point detection in data streams.
method Mixed-integer programming (MIP) for globally optimal PWL fitting.
result Provable tighter relaxations for segment assignment variables.
Symmetric critical points lead to symmetry breaking in neural networks.
problem Understanding symmetry in critical points of invariant functions.
method Analyzing the symmetry of critical points and their neighbors in invariant nonconvex functions.
result Symmetric critical points in invariant nonconvex functions are generically followed by symmetry breaking adjacent points.
Upper bounds found for systole function critical points on surface moduli space.
problem Finding upper bounds for systole function critical points.
method Analyzing the systole function on the surface moduli space.
result Upper bounds for critical points of systole function and their systole values.
Study critical points of Laplace eigenfunctions in polygons.
problem Characterize critical points of Laplace eigenfunctions in polygonal domains.
method Analyze components of the critical set with codimension 1.
result For simply connected polygons, if a second Neumann eigenfunction has infinitely many critical points, the polygon must be a rectangle.
The paper studies critical points in overparameterized neural networks, identifying a star locus and degenerate critical points.
problem Understanding the geometry of loss functions in overparameterized neural networks.
method Identifying and analyzing components of the critical locus of the loss function L for overparameterized feedforward neural networks of depth ℓ≥4. result For very wide networks, all critical points are degenerate, and lower bounds on the number of zero eigenvalues of the Hessian are given.
Noninjective monodromy found in polynomial critical point tracking.
problem Tracking critical points in polynomials leads to noninjective monodromy.
method Monic squarefree complex polynomials with prescribed critical point multiplicities.
result Monodromy map is noninjective for polynomials with exactly two critical points.
In this paper are studied the simplest patterns of axial curvature lines (along which the normal curvature vector is at a vertex of the ellipse of curvature) near a critical point of a surface mapped into R4. These critical points, where the rank of the mapping drops from 2 to 1, occur isolated in generic one parameter…
GBMixed boosts mixed models for clustered data, estimating mean and variance flexibly.
problem Flexible estimation of mean and variance components in clustered data.
method Gradient Boosting framework for linear mixed models with likelihood-based gradients.
result GBMixed accurately recovers complex nonlinear fixed effects and covariances.
Reweighted ALPS improves sampling from multimodal distributions using warm start points.
problem Sampling from multimodal distributions is hard due to exponential mixing times.
method Introduces Reweighted ALPS, a modified Annealed Leap-Point Sampler that uses warm start points.
result First polynomial-time bound for Re-ALPS in a general setting, under a natural assumption.
This paper focuses on the problem of topological equivalence of functions with isolated critical points on the boundary of a compact surface M which are also isolated critical points of their restrictions to the boundary. This class of functions we denote by Ω(M). Firstly, we've obtained the topological classificat…
The paper studies the smoothness of critical points of variational integrals on Hessian spaces.
problem The study focuses on the regularity of critical points of variational integrals defined on Hessian spaces.
method The approach involves solving a fourth order nonlinear equation and analyzing the Hessian of the critical points.
result Smooth critical points with bounded Hessian are shown to be smooth provided their Hessian has small BMO.
DSAC improves cooperative MARL with general utilities, converging faster than existing methods.
problem Improving cooperation in multi-agent reinforcement learning with nonlinear utilities.
method Decentralized Shadow Reward Actor-Critic (DSAC) that estimates local occupancy measures and derivatives.
result DSAC converges to ε-stationarity in O(1/ε^2.5) steps with high probability, finding globally optimal policies.
Study on critical points in random neural networks, revealing three regimes based on activation function.
problem Investigating the expected number of critical points in random neural networks.
method Deriving asymptotic formulas for critical points under infinite-width limit and suitable regularity conditions.
result Three distinct regimes of critical points behavior depending on activation function.
Numerically locating the critical points of non-convex surfaces is a long-standing problem central to many fields. Recently, the loss surfaces of deep neural networks have been explored to gain insight into outstanding questions in optimization, generalization, and network architecture design. However, the degree to wh…
Mixed-integer optimization improves fairness and transparency in machine learning models.
problem Ensuring fairness and transparency in machine learning models deployed in sensitive areas.
method Embedding responsible ML considerations directly into the learning process using mixed-integer optimization.
result MIO enables the learning of inherently transparent models that can incorporate fairness or other constraints.