New geometric mechanism solves four envelope problems.
problem Four basic problems on envelopes created by hyperplane families.
method Simple geometric mechanism of intersections of perpendicular bisectors and normal lines.
result Solves all four basic problems on envelopes at once.
Study investigates OOD generalization methods for mechanics problems.
problem Real-world mechanics problems with unknown test environments and data distribution shifts.
method Investigates OOD generalization methods for regression problems in mechanics.
result OOD generalization methods perform better than traditional ML methods on mechanics-specific regression problems.
In several experimental reports on nonconvex optimization problems in machine learning, stochastic gradient descent (SGD) was observed to prefer minimizers with flat basins in comparison to more deterministic methods, yet there is very little rigorous understanding of this phenomenon. In fact, the lack of such work has…
Introduces Q-structures for mechanics using advanced geometry.
problem Challenges in classical differential geometric constructions in mechanics.
method Explains the use of Q-structures and differential graded manifolds.
result Q-structure preserving integrators can be useful in mechanics.
A solution for the Weinstein's Problem in the general framework of generalized Lie algebroids is the target of this paper. We present the mechanical systems called by use, mechanical (?; ?)-systems, Lagrange mechanical (?; ?)-systems or Finsler mechanical (?; ?)-systems and we develop their geometries. We obtain the ca…
New RL approach learns dynamic VCG mechanisms in unknown MDP environments.
problem Learning dynamic VCG mechanisms in unknown MDP environments.
method Reward-free online RL for exploration, combined with function approximation.
result Regret bound of O~(T2/3) for dynamic VCG mechanism learning. A deep learning approach generates math word problems in multiple languages.
problem Template-based mechanisms for generating mathematical word problems lack customizability and creativity.
method Character Level Long Short Term Memory Network (LSTM) and POS tags are used to generate and resolve constraints in generated problems.
result The approach generates accurate math word problems in English and Sinhala with over 90% accuracy.
Study introduces statistical mechanics for min-max problems.
problem Understanding the properties of min-max problems in high dimensions.
method Statistical mechanical formalism for analyzing min-max problems.
result Derives the relationship between training data and generalization error.
Paper proposes a new hierarchical attention mechanism for multi-scale data.
problem Challenges in applying neural attention to multi-scale, multi-modal data.
method Developed a mathematical framework for multi-modal, multi-scale data and derived optimal neural attention mechanics.
result Proposed hierarchical attention mechanism improves transformer performance in multi-scale, multi-modal settings.
A new adaptive kriging method improves binary classification of mechanical problems.
problem Efficient binary classification of mechanical problems with high fluctuation.
method Monte Carlo-intersite Voronoi (MiVor) adaptive scheme for regression surrogate model.
result The MiVor algorithm provides accurate binary classification with fewer observation points for highly fluctuating response surfaces.
Unified Bayesian framework for uncertainty quantification in mechanics.
problem Propagation of input uncertainties and inference of unknown parameters.
method Bayesian probability theory for forward and inverse problems.
result Unified theoretical framework for both forward and inverse UQ.
Attention mechanism improves various NLP tasks.
problem Improving performance in natural language processing tasks.
method Assigning importance scores to sequence elements for encoding.
result Significant improvement in various NLP tasks.
The aim of the present text is twofold: to provide a compendium of Lagrangian and Hamiltonian geometries and to introduce and investigate new analytical Mechanics: Finslerian, Lagrangian and Hamiltonian. The fundamental equations (or evolution equations) of these Mechanics are derived from the variational calculus appl…
New study shows FTRL mechanism works with correlated events.
problem Forecasting competitions with correlated events.
method Introduces block correlation and uses FTRL mechanism.
result FTRL mechanism retains ε-optimal guarantee with O(b2log(n)/ε2) events for correlated events. Mechanism design for large item sets using topic models.
problem Designing optimal mechanisms for large item sets when exact priors are unknown or intractable.
method Proposes a framework that disentangles statistical estimation and mechanism design, leveraging topic models to reduce complexity.
result Reduces the complexity of mechanism design for large item sets, making it feasible with topic models.
Optimal DP mechanisms for vector queries are found to be staircase distributions.
problem Designing optimal additive mechanisms for vector-valued queries under differential privacy.
method Reduction to radially symmetric distributions and convex rearrangement theory.
result Staircase mechanisms are optimal for any norm and cost function.
This paper tackles time series imputation by identifying and modeling different missing mechanisms.
problem Different types of missing mechanisms (MAR, MNAR) in time series data.
method Proposes a framework for time series imputation by analyzing data generation processes and modeling latent variables via variational inference and normalizing flow.
result Establishes identifiability results for latent variables under nonlinear independent component analysis, showing that latent variables are identifiable.
Classically time is kept fixed for infinitesimal variations in problems in mechanics. Apparently, there appears to be no mathematical justification in the literature for this standard procedure. This can be explained canonically by unveiling the intrinsic mathematical structure of time in Lagrangian mechanics. Moreover…
New mechanism for pure differential privacy on functional summaries using Laplace-like process.
problem Challenges in achieving differential privacy for complex, structured functional summaries.
method Independent Component Laplace Process (ICLP) mechanism for infinite-dimensional Hilbert space.
result Effective enhancement of utility of private summaries through oversmoothing.
Framework uses diffusion models to infer material properties from noisy mechanical measurements.
problem Inference of spatially varying material properties from noisy mechanical responses.
method Conditional score-based diffusion models approximating the score function of a conditional distribution.
result Framework can efficiently solve large-scale physics-based inverse problems.
Paper introduces a new deep-learning method for quantum mechanics.
problem Simulating time-evolving Schrödinger equations efficiently.
method Generative diffusion models and stochastic mechanics.
result Significantly lower computational complexity compared to existing methods.
We present a generally covariant approach to quantum mechanics in which generalized positions, momenta and time variables are treated as coordinates on a fundamental "phase-spacetime." We show that this covariant starting point makes quantization into a purely geometric flatness condition. This makes quantum mechanics …
The paper presents instructive interdisciplinary applications of constrained mechanics calculus in economics on a level appropriate for the undergraduate physics education. The aim of the paper is: 1. to meet the demand for illustrative examples suitable for presenting the background of the highly expanding research fi…
We introduce a theory-driven mechanism for learning a neural network model that performs generative topology design in one shot given a problem setting, circumventing the conventional iterative process that computational design tasks usually entail. The proposed mechanism can lead to machines that quickly response to n…
We study the problem of what causes prices to change. We define the mechanical impact of a trading order as the change in future prices in the absence of any future changes in decision making, and its it informational impact as the remainder of the total impact once mechanical impact is removed. We introduce a method o…
The paper explores invariant subbundles in nonholonomic mechanics.
problem Determining invariant affine subbundles in nonholonomic and constrained variational mechanics.
method Using Spencer cohomology and iterative formulae, the paper formalizes the integrability of linear partial differential equations and determines the largest invariant affine subbundle.
result Iterative formulae for determining the largest invariant affine subbundle are provided.
We develop a geometric version of the inverse problem of the calculus of variations for discrete mechanics and constrained discrete mechanics. The geometric approach consists of using suitable Lagrangian and isotropic submanifolds. We also provide a transition between the discrete and the continuous problems and propos…
New approach identifies latent properties from mechanisms, not just data.
problem Identifying latent properties from data generating processes.
method Equivariance perspective on identifiable representation learning.
result Identification of latent properties is possible up to shared equivariances in known mechanisms.
In this paper, we describe a constrained Lagrangian and Hamiltonian formalism for the optimal control of nonholonomic mechanical systems. In particular, we aim to minimize a cost functional, given initial and final conditions where the controlled dynamics is given by nonholonomic mechanical system. In our paper, the co…
Study on nonholonomic mechanics and sub-Finsler geometry.
problem Understanding nonholonomic mechanical systems and their geometric properties.
method Variational approach, sub-Finsler manifolds, nonholonomic sub-Finslerian structure.
result Existence and properties of extremals in nonholonomic mechanics.
Paper tackles dynamic behavior of variable topology mechanisms, presenting new transition conditions.
problem Dynamic behavior of mechanisms with changing kinematic topology.
method Presented new transition conditions for variable topology mechanisms using projected motion equations and Voronets equations.
result Results show the dynamic behavior of joint locking in 3R and 6DOF mechanisms.
Data is continuously generated by modern data sources, and a recent challenge in machine learning has been to develop techniques that perform well in an incremental (streaming) setting. In this paper, we investigate the problem of private machine learning, where as common in practice, the data is not given at once, but…
CAG method predicts nonlinear solid mechanics responses in real-time with high accuracy and efficiency.
problem Real-time prediction of nonlinear solid mechanics responses.
method Clustering adaptive Gaussian process regression (CAG) method.
result Offers predictions within a second with high precision using only 20 samples.
Paper uses second-order differential geometry to study stochastic mechanics.
problem Stochastic differential equations and their symmetries.
method Develops second-order differential geometry to study symmetries of SDEs and constructs stochastic mechanics.
result Establishes stochastic Lagrangian and Hamiltonian mechanics and their relations with HJB equations.
The paper studies distributions and controllability in quantum mechanical systems.
problem Controlling quantum mechanical systems and their evolution.
method Analysis of distributions, controllability, and geodesics on sub-Finsler manifolds.
result Proves the Lie group decomposition and geodesics equivalence for quantum system steering.
We review the concept of a graded bundle, which is a generalisation of a vector bundle, its linearisation, and a double structure of this kind. We then present applications of these structures in geometric mechanics including systems with higher order Lagrangian and the Plateau problem.
This study uses machine learning to solve PDEs in engineering problems.
problem Solving Partial Differential Equations (PDEs) in engineering for precise system behavior.
method Deep Neural Networks (DNNs) for function approximation of PDE solutions.
result DNNs can effectively approximate PDE solutions for mechanical problems.
Investigates the fundamental components of attention mechanisms.
problem Understanding the building blocks of attention in deep learning.
method Classified and studied three key mechanisms: additive, multiplicative output, and synaptic attention.
result Additive activation attention is central in proofs of lower bounds.
Researchers improve transformer networks' optimization and understanding.
problem Improving the understanding and optimization of transformer networks.
method Introducing a convex alternative to the self-attention mechanism and reformulating the training problem as a convex optimization problem.
result Revealed an implicit regularization mechanism that promotes sparsity across tokens.
KNG mechanism provides sanitized statistical summaries with strong privacy and utility guarantees.
problem Producing sanitized statistical summaries with differential privacy.
method Promotes summaries that minimize an objective function by weighting gradients, achieving utility similar to objective perturbation but with stronger privacy guarantees.
result KNG's noise is asymptotically negligible compared to statistical error for many problems.
Statistical learning relies upon data sampled from a distribution, and we usually do not care what actually generated it in the first place. From the point of view of causal modeling, the structure of each distribution is induced by physical mechanisms that give rise to dependences between observables. Mechanisms, howe…
The paper improves neural network robustness against multiple norm types of adversarial attacks.
problem Defending neural networks against adversarial attacks with different norms.
method Combining existing defense mechanisms to train neural networks robust against both ℓ∞ and ℓ2 attacks. result New defense mechanisms offer better protection against both ℓ∞ and ℓ2 attacks. The paper investigates how Global Self-attention improves GCNs.
problem Improving expressive power and addressing overfitting in GCNs.
method Applying Global Self-attention mechanism over graph features.
result GSA mechanism enhances expressive power and mitigates overfitting and over-smoothing in GCNs.
Paper develops efficient mechanisms for estimating variance and covariance under differential privacy in the add-remove model.
problem Estimating variance and covariance under differential privacy in the add-remove model.
method Developed mechanisms based on the Bézier mechanism, a novel moment-release framework.
result Proved minimax optimality of the Bézier-based estimator in the high-privacy regime and demonstrated its better utility in instance-wise analysis.
Statistical mechanics reveals phase transitions in ε-SVR error.
problem Understanding task precision in neural representations with variability.
method Statistical mechanics applied to ε-SVR. result Double-descent phenomenon in generalization error due to ε. Study on relativistic nonholonomic mechanics with time-dependent constraints.
problem Formulating classical time-dependent nonholonomic mechanics.
method Invariant formulation using moving frames and Chaplygin systems.
result Hamiltonization of time-dependent constraints achieved.
Mechanism designs for unknown agent values in stochastic bandit settings.
problem Designing truthful mechanisms for maximizing social welfare in settings with unknown agent values and stochastic feedback.
method Developed a VCG-like mechanism with regret bounds for multi-round allocations, balancing agent and seller welfare.
result Achieved an $Ω(T^{ rac{2}{3}})$ lower bound for the maximum of welfare, agent utilities, and mechanism utility after T rounds. Geometric mechanism mimics physics' symmetry breaking.
problem Understanding spontaneous symmetry breaking in geometry.
method Analogous to physics, studying symmetry breaking in differential geometry.
result Symmetry breaking can be used to solve geometric problems.