| Commit message (Collapse) | Author | Age |
... | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | | |
PiperOrigin-RevId: 208913262
|
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | | |
PiperOrigin-RevId: 208911623
|
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | | |
PiperOrigin-RevId: 208911179
|
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | | |
deleting constants which did not have any users. It also made an extra clone when number of users reduced to one. While it did not affect correctness, but it's cleaner and more efficient to address these issues.
PiperOrigin-RevId: 208910596
|
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | | |
PiperOrigin-RevId: 208910402
|
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | | |
PiperOrigin-RevId: 208910038
|
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | | |
PiperOrigin-RevId: 208908539
|
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | | |
PiperOrigin-RevId: 208907698
|
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | | |
PiperOrigin-RevId: 208906068
|
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | | |
with another op.
PiperOrigin-RevId: 208903223
|
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | | |
PiperOrigin-RevId: 208902416
|
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | | |
PiperOrigin-RevId: 208896224
|
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | | |
PiperOrigin-RevId: 208894550
|
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | | |
PiperOrigin-RevId: 208893658
|
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | | |
And recurrences denote an infinite list of predicates and thus can be used to
represent the control dependence of loop bodies. This lets us prove that nodes
like "Add" (which have all inputs controlled by a single controlling loop
"CtrlLoopCond") below can be clustered.
digraph G {
_SRC -> CtrlInit
_SRC -> Init0
_SRC -> Init1
CtrlInit -> CtrlMerge
CtrlMerge -> CtrlLoopCond
CtrlLoopCond -> CtrlSwitch
CtrlSwitch -> "CtrlSwitch+1"
"CtrlSwitch+1" -> CtrlMerge
CtrlLoopCond -> CtrlMerge
Init0 -> Merge0
Merge0 -> Switch0
Switch0 -> "Switch0+1"
"Switch0+1" -> NextIteration0
NextIteration0 -> Merge0
CtrlLoopCond -> Switch0
Init1 -> Merge1
Merge1 -> Switch1
Switch1 -> "Switch1+1"
"Switch1+1" -> NextIteration1
NextIteration1 -> Merge1
CtrlLoopCond -> Switch1
}
This graph can be generated from Python code like this (thanks for skyewm@ for
reverse engineering this!):
_, x, y = tf.while_loop(
lambda ctrl, x, y: ctrl < 10,
lambda ctrl, x, y: ctrl + 1, x + 1, y + 1,
[0, 0, 0])
add = x + y
PiperOrigin-RevId: 208891426
|
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | | |
missing values in a SparseTensor.
Also added an extra example.
PiperOrigin-RevId: 208879761
|
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | | |
PiperOrigin-RevId: 208878966
|
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | | |
PiperOrigin-RevId: 208877784
|
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | | |
PiperOrigin-RevId: 208875580
|
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | | |
* Adding pre_train_ops to ConstrainedMinimizationProblem. These are tf.Operations that should be executed before each training step.
* Updating ConstrainedOptimizers to have the train_ops they create depend on the pre_train_ops from the ConstrainedMinimizationProblem.
PiperOrigin-RevId: 208871419
|
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | | |
PiperOrigin-RevId: 208868489
|
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | | |
PiperOrigin-RevId: 208868429
|
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | | |
PiperOrigin-RevId: 208868027
|
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | | |
the peer all-reduces should also be global predecessors. Same for global
successors.
PiperOrigin-RevId: 208865653
|
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | | |
PiperOrigin-RevId: 208865526
|
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | | |
- Create a pack/unstack transformation "rule".
- Handle aggregates with tags that are aggregated against.
- Make convert_to_stubs use graph_defs rather than just sessions.
PiperOrigin-RevId: 208865349
|
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | | |
PiperOrigin-RevId: 208864844
|
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | |
| | | | | | | | | | | |
Control dependencies are an artifact left over from lowering. These should be removed when raising to a despecialized form.
PiperOrigin-RevId: 208862729
|
|\ \ \ \ \ \ \ \ \ \ \
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | | |
PiperOrigin-RevId: 208857243
|
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | | |
PiperOrigin-RevId: 208856945
|
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | | |
This will enable switching out the default stats collection mechanism
(based on strings and protocol buffers) for a lighter-weight
implementation that can be used in other settings.
PiperOrigin-RevId: 208851452
|
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | | |
PiperOrigin-RevId: 208850456
|
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | | |
allowed behavior in tf.Estimator
NB: Calls data/util/nest.flatten() which is slightly different than core/util/nest (already a dependency in tpu_estimator.py) as it maintains structure by treating tuples and lists differently
PiperOrigin-RevId: 208848267
|
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | | |
(1) previously, it set unknown shape flag for scalar input, but now it
returns TensorShapeProto with rank equal to the expected and all dims set to 1,
and unknown shape flag is not set.
(2) Also, fixed a bug; when a rank is known, but dim_size() < rank (note that
dim_size() may be non-zero), we previously called add_dim() with dim 1 rank
times, which then makes dim_size() is incremented by rank, but we expect
dim_size() equal to rank.
(3) Added test for MaybeGetMinimumShape().
PiperOrigin-RevId: 208845501
|
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | | |
PiperOrigin-RevId: 208843066
|
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | | |
PiperOrigin-RevId: 208838993
|
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | | |
PiperOrigin-RevId: 208836927
|
| | | | | | | | | | | | |
|
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | | |
This operation computes:
result[i1, ..., in] = params[i1, ..., in-1, indices[i1, ..., in]]
That is, it assumes that `params` and `indices` have n-1 leading dense dimensions, followed by a sparse dimensions over which we want to gather.
PiperOrigin-RevId: 208836509
|
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | | |
Provide the necessary flags for reading/writing binary
protobuf/flatbuffer files. With this fix, toco behavior should now
be consistent with other platforms.
This fixes #21085.
PiperOrigin-RevId: 208834940
|
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | | |
PiperOrigin-RevId: 208834783
|
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | | |
PiperOrigin-RevId: 208834294
|
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | | |
The previous implementation used a very generic helper function what
added a large amount of overhead to a very simple operation.
PiperOrigin-RevId: 208799040
|
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | | |
PiperOrigin-RevId: 208786904
|
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | | |
PiperOrigin-RevId: 208783215
|
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | | |
other relevant security links.
PiperOrigin-RevId: 208775844
|
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | | |
PiperOrigin-RevId: 208775205
|
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | | |
optimizer_v2 version of RMSProp.
PiperOrigin-RevId: 208774314
|
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | | |
Since reshape shouldn't change minmax info.
PiperOrigin-RevId: 208772357
|
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | |
| | | | | | | | | | | | |
FakeQuant
PiperOrigin-RevId: 208767575
|